./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/float_req_bl_1270b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/float_req_bl_1270b_true-unreach-call.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 1203da81dc5c48f4dda347acec83e1939b55600b ......................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/float_req_bl_1270b_true-unreach-call.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 1203da81dc5c48f4dda347acec83e1939b55600b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:16:38,720 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:16:38,721 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:16:38,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:16:38,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:16:38,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:16:38,736 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:16:38,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:16:38,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:16:38,741 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:16:38,742 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:16:38,742 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:16:38,743 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:16:38,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:16:38,745 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:16:38,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:16:38,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:16:38,749 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:16:38,751 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:16:38,753 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:16:38,754 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:16:38,756 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:16:38,758 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:16:38,759 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:16:38,759 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:16:38,760 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:16:38,761 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:16:38,762 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:16:38,763 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:16:38,764 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:16:38,764 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:16:38,765 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:16:38,765 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:16:38,766 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:16:38,767 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:16:38,768 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:16:38,768 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:16:38,784 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:16:38,785 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:16:38,786 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:16:38,786 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:16:38,786 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:16:38,787 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:16:38,787 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:16:38,787 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:16:38,787 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:16:38,787 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:16:38,787 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:16:38,788 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:16:38,788 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:16:38,788 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:16:38,788 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:16:38,788 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:16:38,788 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:16:38,789 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:16:38,789 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:16:38,789 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:16:38,789 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:16:38,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:38,790 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:16:38,790 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:16:38,790 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:16:38,790 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:16:38,790 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:16:38,790 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:16:38,791 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 1203da81dc5c48f4dda347acec83e1939b55600b [2019-01-12 09:16:38,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:16:38,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:16:38,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:16:38,863 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:16:38,863 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:16:38,864 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1270b_true-unreach-call.c [2019-01-12 09:16:38,922 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbf65c58/0c0de5f944564cf8879b7bc7996144d9/FLAGa3f24bfe1 [2019-01-12 09:16:39,384 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:16:39,385 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1270b_true-unreach-call.c [2019-01-12 09:16:39,393 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbf65c58/0c0de5f944564cf8879b7bc7996144d9/FLAGa3f24bfe1 [2019-01-12 09:16:39,709 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbf65c58/0c0de5f944564cf8879b7bc7996144d9 [2019-01-12 09:16:39,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:16:39,718 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:16:39,720 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:39,720 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:16:39,723 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:16:39,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:39" (1/1) ... [2019-01-12 09:16:39,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65b41bf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:39, skipping insertion in model container [2019-01-12 09:16:39,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:39" (1/1) ... [2019-01-12 09:16:39,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:16:39,787 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:16:40,112 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:40,116 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:16:40,194 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:40,231 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:16:40,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40 WrapperNode [2019-01-12 09:16:40,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:40,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:40,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:16:40,233 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:16:40,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40" (1/1) ... [2019-01-12 09:16:40,321 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40" (1/1) ... [2019-01-12 09:16:40,371 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:40,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:16:40,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:16:40,374 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:16:40,385 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40" (1/1) ... [2019-01-12 09:16:40,385 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40" (1/1) ... [2019-01-12 09:16:40,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40" (1/1) ... [2019-01-12 09:16:40,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40" (1/1) ... [2019-01-12 09:16:40,424 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40" (1/1) ... [2019-01-12 09:16:40,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40" (1/1) ... [2019-01-12 09:16:40,448 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40" (1/1) ... [2019-01-12 09:16:40,460 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:16:40,462 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:16:40,462 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:16:40,462 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:16:40,463 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:16:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:16:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:16:40,520 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:16:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:16:40,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:16:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:16:40,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:16:41,770 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:16:41,770 INFO L286 CfgBuilder]: Removed 52 assue(true) statements. [2019-01-12 09:16:41,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:41 BoogieIcfgContainer [2019-01-12 09:16:41,772 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:16:41,773 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:16:41,773 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:16:41,777 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:16:41,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:16:39" (1/3) ... [2019-01-12 09:16:41,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756fb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:41, skipping insertion in model container [2019-01-12 09:16:41,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:40" (2/3) ... [2019-01-12 09:16:41,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@756fb11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:41, skipping insertion in model container [2019-01-12 09:16:41,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:41" (3/3) ... [2019-01-12 09:16:41,782 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b_true-unreach-call.c [2019-01-12 09:16:41,792 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:16:41,801 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:16:41,818 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:16:41,863 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:16:41,863 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:16:41,864 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:16:41,864 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:16:41,864 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:16:41,864 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:16:41,864 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:16:41,864 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:16:41,865 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:16:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-01-12 09:16:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:16:41,888 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:41,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:41,891 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:41,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:41,897 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-01-12 09:16:41,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:41,899 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:41,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:41,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:41,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:42,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:42,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:16:42,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:16:42,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:16:42,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:42,034 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-01-12 09:16:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:42,064 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-01-12 09:16:42,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:16:42,065 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 09:16:42,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:42,077 INFO L225 Difference]: With dead ends: 212 [2019-01-12 09:16:42,077 INFO L226 Difference]: Without dead ends: 104 [2019-01-12 09:16:42,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-12 09:16:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-12 09:16:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 09:16:42,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-01-12 09:16:42,126 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-01-12 09:16:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:42,126 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-01-12 09:16:42,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:16:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-01-12 09:16:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:16:42,128 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:42,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:42,129 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:42,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:42,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-01-12 09:16:42,129 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:42,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:42,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:42,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:42,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:42,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:16:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:16:42,411 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:16:42,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:16:42 BoogieIcfgContainer [2019-01-12 09:16:42,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:16:42,476 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:16:42,477 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:16:42,477 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:16:42,477 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:41" (3/4) ... [2019-01-12 09:16:42,487 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:16:42,487 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:16:42,488 INFO L168 Benchmark]: Toolchain (without parser) took 2771.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 948.7 MB in the beginning and 1.0 GB in the end (delta: -95.1 MB). Peak memory consumption was 46.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,491 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:16:42,493 INFO L168 Benchmark]: CACSL2BoogieTranslator took 512.48 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -196.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,496 INFO L168 Benchmark]: Boogie Preprocessor took 88.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:16:42,497 INFO L168 Benchmark]: RCFGBuilder took 1310.36 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: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,498 INFO L168 Benchmark]: TraceAbstraction took 702.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:42,500 INFO L168 Benchmark]: Witness Printer took 11.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:16:42,507 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 512.48 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 140.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -196.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.11 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1310.36 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: 51.8 MB). Peak memory consumption was 51.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 702.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 33.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * Witness Printer took 11.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 235]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticFLOAToperation at line 118, overapproximation of bitwiseAnd at line 218. Possible FailurePath: [L12] static const float one_sqrt = 1.0, tiny_sqrt = 1.0e-30; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L229] float x = -1.0f / 0.0f; [L230] float y = __VERIFIER_nondet_float(); [L82] float a = x, b = y, t1, t2, y1, y2, w; [L83] __int32_t j, k, ha, hb; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L86] ieee_float_shape_type gf_u; [L87] gf_u.value = (x) [L88] EXPR gf_u.word [L88] (ha) = gf_u.word [L90] ha &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L92] ieee_float_shape_type gf_u; [L93] gf_u.value = (y) [L94] EXPR gf_u.word [L94] (hb) = gf_u.word [L96] hb &= 0x7fffffffL VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L97] COND FALSE !(hb > ha) [L104] a = x [L105] b = y VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L108] ieee_float_shape_type sf_u; [L109] sf_u.word = (ha) [L110] EXPR sf_u.value [L110] (a) = sf_u.value [L113] ieee_float_shape_type sf_u; [L114] sf_u.word = (hb) [L115] EXPR sf_u.value [L115] (b) = sf_u.value [L117] COND TRUE (ha - hb) > 0xf000000L [L118] return a + b; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L232] float res = __ieee754_hypotf(x, y); [L212] __int32_t ix; VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L214] ieee_float_shape_type gf_u; [L215] gf_u.value = (x) [L216] EXPR gf_u.word [L216] (ix) = gf_u.word [L218] ix &= 0x7fffffff [L219] return ((ix) == 0x7f800000L); VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] [L234] COND TRUE !isinf_float(res) [L235] __VERIFIER_error() VAL [one_sqrt=1, tiny_sqrt=1/1000000000000000000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 107 locations, 1 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 139 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:16:44,882 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:16:44,884 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:16:44,903 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:16:44,903 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:16:44,904 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:16:44,906 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:16:44,907 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:16:44,909 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:16:44,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:16:44,912 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:16:44,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:16:44,913 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:16:44,914 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:16:44,915 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:16:44,916 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:16:44,917 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:16:44,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:16:44,921 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:16:44,923 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:16:44,924 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:16:44,926 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:16:44,928 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:16:44,929 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:16:44,929 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:16:44,930 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:16:44,931 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:16:44,932 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:16:44,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:16:44,934 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:16:44,935 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:16:44,935 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:16:44,936 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:16:44,936 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:16:44,937 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:16:44,938 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:16:44,938 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:16:44,957 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:16:44,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:16:44,958 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:16:44,959 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:16:44,959 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:16:44,960 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:16:44,960 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:16:44,960 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:16:44,960 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:16:44,960 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:16:44,960 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:16:44,961 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:16:44,962 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:16:44,962 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:16:44,962 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:16:44,962 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:16:44,962 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:16:44,963 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:16:44,963 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:16:44,963 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:16:44,963 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:16:44,963 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:16:44,963 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:44,965 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:16:44,965 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:16:44,965 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:16:44,966 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:16:44,966 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:16:44,966 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:16:44,967 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:16:44,967 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> 1203da81dc5c48f4dda347acec83e1939b55600b [2019-01-12 09:16:45,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:16:45,049 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:16:45,055 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:16:45,057 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:16:45,058 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:16:45,059 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1270b_true-unreach-call.c [2019-01-12 09:16:45,122 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b398fe883/6976ca5d246441f5ba9e40e85feced42/FLAG8c2737598 [2019-01-12 09:16:45,595 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:16:45,596 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1270b_true-unreach-call.c [2019-01-12 09:16:45,610 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b398fe883/6976ca5d246441f5ba9e40e85feced42/FLAG8c2737598 [2019-01-12 09:16:45,908 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b398fe883/6976ca5d246441f5ba9e40e85feced42 [2019-01-12 09:16:45,911 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:16:45,913 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:16:45,914 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:45,914 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:16:45,918 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:16:45,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:45" (1/1) ... [2019-01-12 09:16:45,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@645056fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:45, skipping insertion in model container [2019-01-12 09:16:45,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:45" (1/1) ... [2019-01-12 09:16:45,933 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:16:45,971 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:16:46,255 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:46,269 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:16:46,370 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:46,402 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:16:46,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46 WrapperNode [2019-01-12 09:16:46,403 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:46,404 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:46,404 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:16:46,404 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:16:46,512 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46" (1/1) ... [2019-01-12 09:16:46,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46" (1/1) ... [2019-01-12 09:16:46,615 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:46,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:16:46,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:16:46,615 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:16:46,630 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46" (1/1) ... [2019-01-12 09:16:46,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46" (1/1) ... [2019-01-12 09:16:46,643 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46" (1/1) ... [2019-01-12 09:16:46,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46" (1/1) ... [2019-01-12 09:16:46,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46" (1/1) ... [2019-01-12 09:16:46,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46" (1/1) ... [2019-01-12 09:16:46,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46" (1/1) ... [2019-01-12 09:16:46,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:16:46,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:16:46,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:16:46,725 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:16:46,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:46,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:16:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2019-01-12 09:16:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:16:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:16:46,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:16:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-01-12 09:16:46,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:16:46,789 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:16:47,205 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:47,303 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:49,593 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:52,904 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:53,023 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:53,539 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:16:53,540 INFO L286 CfgBuilder]: Removed 52 assue(true) statements. [2019-01-12 09:16:53,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:53 BoogieIcfgContainer [2019-01-12 09:16:53,541 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:16:53,542 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:16:53,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:16:53,546 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:16:53,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:16:45" (1/3) ... [2019-01-12 09:16:53,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9bfa40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:53, skipping insertion in model container [2019-01-12 09:16:53,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:46" (2/3) ... [2019-01-12 09:16:53,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b9bfa40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:53, skipping insertion in model container [2019-01-12 09:16:53,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:53" (3/3) ... [2019-01-12 09:16:53,552 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1270b_true-unreach-call.c [2019-01-12 09:16:53,562 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:16:53,571 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:16:53,589 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:16:53,624 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:16:53,625 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:16:53,625 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:16:53,625 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:16:53,625 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:16:53,625 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:16:53,625 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:16:53,626 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:16:53,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:16:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states. [2019-01-12 09:16:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:16:53,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:53,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:53,653 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:53,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:53,659 INFO L82 PathProgramCache]: Analyzing trace with hash 311741284, now seen corresponding path program 1 times [2019-01-12 09:16:53,663 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:53,663 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:53,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:53,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:53,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:53,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:53,787 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:53,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:53,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:16:53,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:16:53,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:16:53,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:53,828 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 2 states. [2019-01-12 09:16:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:53,857 INFO L93 Difference]: Finished difference Result 212 states and 358 transitions. [2019-01-12 09:16:53,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:16:53,859 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-01-12 09:16:53,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:53,875 INFO L225 Difference]: With dead ends: 212 [2019-01-12 09:16:53,875 INFO L226 Difference]: Without dead ends: 104 [2019-01-12 09:16:53,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:53,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-12 09:16:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-12 09:16:53,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-12 09:16:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 136 transitions. [2019-01-12 09:16:53,927 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 136 transitions. Word has length 16 [2019-01-12 09:16:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:53,928 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 136 transitions. [2019-01-12 09:16:53,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:16:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 136 transitions. [2019-01-12 09:16:53,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:16:53,932 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:53,932 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:53,932 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:53,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:53,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2055151297, now seen corresponding path program 1 times [2019-01-12 09:16:53,937 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:53,937 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:53,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:54,066 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:56,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:16:56,887 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:56,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:56,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 09:16:56,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 09:16:56,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 09:16:56,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:16:56,920 INFO L87 Difference]: Start difference. First operand 104 states and 136 transitions. Second operand 13 states. [2019-01-12 09:16:58,776 WARN L181 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-12 09:17:00,709 WARN L181 SmtUtils]: Spent 775.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-01-12 09:17:03,368 WARN L181 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 67 [2019-01-12 09:17:06,631 WARN L181 SmtUtils]: Spent 1.73 s on a formula simplification that was a NOOP. DAG size: 70 [2019-01-12 09:17:09,267 WARN L181 SmtUtils]: Spent 1.80 s on a formula simplification that was a NOOP. DAG size: 75 [2019-01-12 09:17:09,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:09,639 INFO L93 Difference]: Finished difference Result 234 states and 296 transitions. [2019-01-12 09:17:09,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 09:17:09,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2019-01-12 09:17:09,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:09,657 INFO L225 Difference]: With dead ends: 234 [2019-01-12 09:17:09,657 INFO L226 Difference]: Without dead ends: 141 [2019-01-12 09:17:09,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=141, Invalid=365, Unknown=0, NotChecked=0, Total=506 [2019-01-12 09:17:09,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-01-12 09:17:09,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 112. [2019-01-12 09:17:09,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-12 09:17:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 144 transitions. [2019-01-12 09:17:09,679 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 144 transitions. Word has length 21 [2019-01-12 09:17:09,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:09,680 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 144 transitions. [2019-01-12 09:17:09,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 09:17:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 144 transitions. [2019-01-12 09:17:09,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:17:09,681 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:09,682 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:09,683 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:09,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:09,683 INFO L82 PathProgramCache]: Analyzing trace with hash -1653009985, now seen corresponding path program 1 times [2019-01-12 09:17:09,684 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:09,684 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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) [2019-01-12 09:17:09,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:09,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:09,846 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:10,049 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:10,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:10,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:17:10,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:17:10,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:17:10,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:17:10,067 INFO L87 Difference]: Start difference. First operand 112 states and 144 transitions. Second operand 7 states. [2019-01-12 09:17:10,470 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2019-01-12 09:17:11,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:11,419 INFO L93 Difference]: Finished difference Result 285 states and 366 transitions. [2019-01-12 09:17:11,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:17:11,422 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 09:17:11,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:11,429 INFO L225 Difference]: With dead ends: 285 [2019-01-12 09:17:11,429 INFO L226 Difference]: Without dead ends: 204 [2019-01-12 09:17:11,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:17:11,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-01-12 09:17:11,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 114. [2019-01-12 09:17:11,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-12 09:17:11,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 145 transitions. [2019-01-12 09:17:11,481 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 145 transitions. Word has length 21 [2019-01-12 09:17:11,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:11,483 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 145 transitions. [2019-01-12 09:17:11,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:17:11,483 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 145 transitions. [2019-01-12 09:17:11,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:17:11,485 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:11,486 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:11,486 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:11,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:11,486 INFO L82 PathProgramCache]: Analyzing trace with hash -558668800, now seen corresponding path program 1 times [2019-01-12 09:17:11,488 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:11,489 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:11,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:11,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:11,621 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:11,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:11,926 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:11,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:11,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:17:11,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:17:11,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:17:11,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:17:11,938 INFO L87 Difference]: Start difference. First operand 114 states and 145 transitions. Second operand 10 states. [2019-01-12 09:17:20,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:20,039 INFO L93 Difference]: Finished difference Result 151 states and 180 transitions. [2019-01-12 09:17:20,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:17:20,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-01-12 09:17:20,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:20,056 INFO L225 Difference]: With dead ends: 151 [2019-01-12 09:17:20,056 INFO L226 Difference]: Without dead ends: 142 [2019-01-12 09:17:20,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-01-12 09:17:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-01-12 09:17:20,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 114. [2019-01-12 09:17:20,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-12 09:17:20,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 144 transitions. [2019-01-12 09:17:20,077 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 144 transitions. Word has length 26 [2019-01-12 09:17:20,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:20,078 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 144 transitions. [2019-01-12 09:17:20,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:17:20,078 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 144 transitions. [2019-01-12 09:17:20,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:17:20,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:20,079 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:20,079 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:20,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:20,081 INFO L82 PathProgramCache]: Analyzing trace with hash 121389570, now seen corresponding path program 1 times [2019-01-12 09:17:20,082 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:20,082 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:20,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:20,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:20,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:20,599 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:20,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:20,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 09:17:20,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 09:17:20,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 09:17:20,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:17:20,611 INFO L87 Difference]: Start difference. First operand 114 states and 144 transitions. Second operand 12 states. [2019-01-12 09:17:21,986 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-12 09:17:30,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:30,784 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2019-01-12 09:17:30,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:17:30,794 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-01-12 09:17:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:30,796 INFO L225 Difference]: With dead ends: 133 [2019-01-12 09:17:30,796 INFO L226 Difference]: Without dead ends: 115 [2019-01-12 09:17:30,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2019-01-12 09:17:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-12 09:17:30,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2019-01-12 09:17:30,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-12 09:17:30,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 134 transitions. [2019-01-12 09:17:30,822 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 134 transitions. Word has length 26 [2019-01-12 09:17:30,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:30,823 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 134 transitions. [2019-01-12 09:17:30,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 09:17:30,823 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 134 transitions. [2019-01-12 09:17:30,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:17:30,824 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:30,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:30,825 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:30,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:30,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1435475906, now seen corresponding path program 1 times [2019-01-12 09:17:30,825 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:30,825 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:30,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:30,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:30,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:31,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:31,223 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:31,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:31,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:17:31,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:17:31,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:17:31,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:17:31,236 INFO L87 Difference]: Start difference. First operand 105 states and 134 transitions. Second operand 7 states. [2019-01-12 09:17:31,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:31,587 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2019-01-12 09:17:31,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:17:31,589 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-01-12 09:17:31,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:31,589 INFO L225 Difference]: With dead ends: 115 [2019-01-12 09:17:31,590 INFO L226 Difference]: Without dead ends: 27 [2019-01-12 09:17:31,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:17:31,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-12 09:17:31,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-01-12 09:17:31,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-12 09:17:31,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-01-12 09:17:31,604 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2019-01-12 09:17:31,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:31,605 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-01-12 09:17:31,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:17:31,605 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-01-12 09:17:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-01-12 09:17:31,605 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:17:31,606 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:17:31,607 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:17:31,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:17:31,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1042448896, now seen corresponding path program 1 times [2019-01-12 09:17:31,608 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:17:31,609 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-01-12 09:17:31,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:17:31,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:17:31,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:17:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:17:32,208 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:17:32,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:17:32,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-01-12 09:17:32,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 09:17:32,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 09:17:32,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:17:32,220 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 13 states. [2019-01-12 09:17:33,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:17:33,558 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-01-12 09:17:33,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 09:17:33,558 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-01-12 09:17:33,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:17:33,558 INFO L225 Difference]: With dead ends: 27 [2019-01-12 09:17:33,558 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:17:33,559 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=119, Invalid=387, Unknown=0, NotChecked=0, Total=506 [2019-01-12 09:17:33,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:17:33,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:17:33,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:17:33,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:17:33,560 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-01-12 09:17:33,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:17:33,561 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:17:33,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 09:17:33,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:17:33,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:17:33,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:17:33,673 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 126 [2019-01-12 09:17:34,932 WARN L181 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 126 DAG size of output: 92 [2019-01-12 09:17:42,802 WARN L181 SmtUtils]: Spent 7.87 s on a formula simplification. DAG size of input: 155 DAG size of output: 115 [2019-01-12 09:17:46,938 WARN L181 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 137 DAG size of output: 100 [2019-01-12 09:17:47,023 INFO L448 ceAbstractionStarter]: For program point L35-2(lines 35 39) no Hoare annotation was computed. [2019-01-12 09:17:47,023 INFO L448 ceAbstractionStarter]: For program point L35-3(lines 35 39) no Hoare annotation was computed. [2019-01-12 09:17:47,023 INFO L448 ceAbstractionStarter]: For program point L35-5(lines 35 39) no Hoare annotation was computed. [2019-01-12 09:17:47,024 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 237) no Hoare annotation was computed. [2019-01-12 09:17:47,024 INFO L448 ceAbstractionStarter]: For program point L36-2(lines 36 37) no Hoare annotation was computed. [2019-01-12 09:17:47,024 INFO L444 ceAbstractionStarter]: At program point L36-3(lines 36 37) the Hoare annotation is: false [2019-01-12 09:17:47,024 INFO L448 ceAbstractionStarter]: For program point L36-4(lines 36 37) no Hoare annotation was computed. [2019-01-12 09:17:47,024 INFO L448 ceAbstractionStarter]: For program point L36-7(lines 36 37) no Hoare annotation was computed. [2019-01-12 09:17:47,024 INFO L444 ceAbstractionStarter]: At program point L36-8(lines 36 37) the Hoare annotation is: false [2019-01-12 09:17:47,025 INFO L448 ceAbstractionStarter]: For program point L36-9(lines 36 37) no Hoare annotation was computed. [2019-01-12 09:17:47,025 INFO L448 ceAbstractionStarter]: For program point L235(line 235) no Hoare annotation was computed. [2019-01-12 09:17:47,025 INFO L451 ceAbstractionStarter]: At program point L238(lines 222 239) the Hoare annotation is: true [2019-01-12 09:17:47,025 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 143) no Hoare annotation was computed. [2019-01-12 09:17:47,025 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 121 144) no Hoare annotation was computed. [2019-01-12 09:17:47,025 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 73 77) no Hoare annotation was computed. [2019-01-12 09:17:47,025 INFO L444 ceAbstractionStarter]: At program point L73-2(lines 73 77) the Hoare annotation is: false [2019-01-12 09:17:47,025 INFO L448 ceAbstractionStarter]: For program point L73-3(lines 73 77) no Hoare annotation was computed. [2019-01-12 09:17:47,025 INFO L448 ceAbstractionStarter]: For program point L73-5(lines 73 77) no Hoare annotation was computed. [2019-01-12 09:17:47,025 INFO L444 ceAbstractionStarter]: At program point L73-6(lines 73 77) the Hoare annotation is: false [2019-01-12 09:17:47,026 INFO L448 ceAbstractionStarter]: For program point L73-7(lines 73 77) no Hoare annotation was computed. [2019-01-12 09:17:47,026 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 111) no Hoare annotation was computed. [2019-01-12 09:17:47,026 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 81 208) no Hoare annotation was computed. [2019-01-12 09:17:47,026 INFO L444 ceAbstractionStarter]: At program point L207(lines 81 208) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (.cse1 (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)) ULTIMATE.start___ieee754_hypotf_~b~0))) (or (let ((.cse2 (fp (_ bv0 1) (_ bv255 8) (_ bv0 23)))) (and .cse0 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_29 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_29))) .cse1 (= .cse2 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse2 |ULTIMATE.start___ieee754_hypotf_#res|))) (and .cse0 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28)) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (= (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) ULTIMATE.start___ieee754_hypotf_~w~0))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (= (let ((.cse4 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) |ULTIMATE.start___ieee754_hypotf_#res|))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (= (let ((.cse5 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ULTIMATE.start___ieee754_hypotf_~a~0)))) (and .cse0 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_25 (_ BitVec 32))) (let ((.cse7 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (.cse6 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26))) (and (bvsgt (bvadd (bvneg .cse6) .cse7) (_ bv251658240 32)) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7)) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))) |ULTIMATE.start___ieee754_hypotf_#res|) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) .cse1 (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_25 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26)))))) [2019-01-12 09:17:47,026 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 43) no Hoare annotation was computed. [2019-01-12 09:17:47,027 INFO L448 ceAbstractionStarter]: For program point L42-2(lines 42 43) no Hoare annotation was computed. [2019-01-12 09:17:47,027 INFO L448 ceAbstractionStarter]: For program point L42-3(lines 42 43) no Hoare annotation was computed. [2019-01-12 09:17:47,027 INFO L448 ceAbstractionStarter]: For program point L42-5(lines 42 43) no Hoare annotation was computed. [2019-01-12 09:17:47,027 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 198) no Hoare annotation was computed. [2019-01-12 09:17:47,027 INFO L448 ceAbstractionStarter]: For program point L175-2(lines 81 208) no Hoare annotation was computed. [2019-01-12 09:17:47,027 INFO L448 ceAbstractionStarter]: For program point L176-1(lines 176 180) no Hoare annotation was computed. [2019-01-12 09:17:47,027 INFO L444 ceAbstractionStarter]: At program point L176-2(lines 176 180) the Hoare annotation is: false [2019-01-12 09:17:47,027 INFO L448 ceAbstractionStarter]: For program point L176-3(lines 176 180) no Hoare annotation was computed. [2019-01-12 09:17:47,027 INFO L444 ceAbstractionStarter]: At program point L78(lines 14 79) the Hoare annotation is: false [2019-01-12 09:17:47,028 INFO L444 ceAbstractionStarter]: At program point L78-1(lines 14 79) the Hoare annotation is: false [2019-01-12 09:17:47,028 INFO L448 ceAbstractionStarter]: For program point L145(lines 145 172) no Hoare annotation was computed. [2019-01-12 09:17:47,028 INFO L448 ceAbstractionStarter]: For program point L112(lines 112 116) no Hoare annotation was computed. [2019-01-12 09:17:47,028 INFO L448 ceAbstractionStarter]: For program point L112-1(lines 81 208) no Hoare annotation was computed. [2019-01-12 09:17:47,028 INFO L448 ceAbstractionStarter]: For program point L112-2(lines 81 208) no Hoare annotation was computed. [2019-01-12 09:17:47,028 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 171) no Hoare annotation was computed. [2019-01-12 09:17:47,028 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 213 217) no Hoare annotation was computed. [2019-01-12 09:17:47,029 INFO L444 ceAbstractionStarter]: At program point L213-2(lines 213 217) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (.cse6 (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)) ULTIMATE.start___ieee754_hypotf_~b~0))) (or (and .cse0 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28)) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (= (let ((.cse1 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) ULTIMATE.start___ieee754_hypotf_~w~0))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (= (let ((.cse2 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) |ULTIMATE.start___ieee754_hypotf_#res|))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (= ULTIMATE.start_isinf_float_~x (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (= (let ((.cse4 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4))) ULTIMATE.start___ieee754_hypotf_~a~0)))) (let ((.cse5 (fp (_ bv0 1) (_ bv255 8) (_ bv0 23)))) (and .cse0 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_29 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_29))) (= ULTIMATE.start_isinf_float_~x .cse5) .cse6 (= .cse5 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse5 |ULTIMATE.start___ieee754_hypotf_#res|))) (and .cse0 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_25 (_ BitVec 32))) (let ((.cse8 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (.cse7 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26))) (and (bvsgt (bvadd (bvneg .cse7) .cse8) (_ bv251658240 32)) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse8) ((_ extract 30 23) .cse8) ((_ extract 22 0) .cse8)) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))) |ULTIMATE.start___ieee754_hypotf_#res|) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) .cse6 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_25 (_ BitVec 32))) (let ((.cse10 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26)) (.cse9 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9)) (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10))) ULTIMATE.start_isinf_float_~x) (bvsgt (bvadd (bvneg .cse10) .cse9) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_25 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26)))))) [2019-01-12 09:17:47,029 INFO L448 ceAbstractionStarter]: For program point L213-3(lines 213 217) no Hoare annotation was computed. [2019-01-12 09:17:47,029 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 171) no Hoare annotation was computed. [2019-01-12 09:17:47,029 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 149 153) no Hoare annotation was computed. [2019-01-12 09:17:47,029 INFO L444 ceAbstractionStarter]: At program point L149-2(lines 149 153) the Hoare annotation is: false [2019-01-12 09:17:47,030 INFO L448 ceAbstractionStarter]: For program point L149-3(lines 149 153) no Hoare annotation was computed. [2019-01-12 09:17:47,030 INFO L444 ceAbstractionStarter]: At program point L50-2(lines 50 59) the Hoare annotation is: false [2019-01-12 09:17:47,033 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 14 79) no Hoare annotation was computed. [2019-01-12 09:17:47,033 INFO L444 ceAbstractionStarter]: At program point L50-6(lines 50 59) the Hoare annotation is: false [2019-01-12 09:17:47,033 INFO L448 ceAbstractionStarter]: For program point L50-7(lines 14 79) no Hoare annotation was computed. [2019-01-12 09:17:47,033 INFO L448 ceAbstractionStarter]: For program point L85-1(lines 85 89) no Hoare annotation was computed. [2019-01-12 09:17:47,033 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 56) no Hoare annotation was computed. [2019-01-12 09:17:47,033 INFO L444 ceAbstractionStarter]: At program point L85-2(lines 85 89) the Hoare annotation is: (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) [2019-01-12 09:17:47,033 INFO L448 ceAbstractionStarter]: For program point L85-3(lines 85 89) no Hoare annotation was computed. [2019-01-12 09:17:47,034 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:17:47,034 INFO L448 ceAbstractionStarter]: For program point L52-2(lines 52 56) no Hoare annotation was computed. [2019-01-12 09:17:47,034 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-01-12 09:17:47,034 INFO L448 ceAbstractionStarter]: For program point L52-3(lines 52 56) no Hoare annotation was computed. [2019-01-12 09:17:47,034 INFO L448 ceAbstractionStarter]: For program point L19-3(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:17:47,034 INFO L448 ceAbstractionStarter]: For program point L52-5(lines 52 56) no Hoare annotation was computed. [2019-01-12 09:17:47,034 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:17:47,034 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-01-12 09:17:47,034 INFO L448 ceAbstractionStarter]: For program point L19-7(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:17:47,034 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:17:47,035 INFO L448 ceAbstractionStarter]: For program point L185-1(lines 185 189) no Hoare annotation was computed. [2019-01-12 09:17:47,035 INFO L444 ceAbstractionStarter]: At program point L185-2(lines 185 189) the Hoare annotation is: false [2019-01-12 09:17:47,035 INFO L448 ceAbstractionStarter]: For program point L185-3(lines 185 189) no Hoare annotation was computed. [2019-01-12 09:17:47,036 INFO L444 ceAbstractionStarter]: At program point L219(lines 211 220) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))) (.cse1 (= (_ bv1 32) |ULTIMATE.start_isinf_float_#res|)) (.cse8 (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~hb~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~hb~0)) ULTIMATE.start___ieee754_hypotf_~b~0))) (or (and .cse0 .cse1 (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28)) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (= (let ((.cse2 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))) ULTIMATE.start___ieee754_hypotf_~w~0))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (= (let ((.cse3 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))) |ULTIMATE.start___ieee754_hypotf_#res|))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (= ULTIMATE.start_isinf_float_~x (let ((.cse4 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse4) ((_ extract 30 23) .cse4) ((_ extract 22 0) .cse4)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (= (let ((.cse5 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))) ULTIMATE.start___ieee754_hypotf_~a~0))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_28 (_ BitVec 32))) (and (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) (let ((.cse6 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_28)))))) (let ((.cse7 (fp (_ bv0 1) (_ bv255 8) (_ bv0 23)))) (and .cse0 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_29 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_29))) .cse1 (= ULTIMATE.start_isinf_float_~x .cse7) .cse8 (= (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1)) .cse7) (= .cse7 ULTIMATE.start___ieee754_hypotf_~w~0) (= .cse7 |ULTIMATE.start___ieee754_hypotf_#res|))) (and .cse0 .cse1 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_25 (_ BitVec 32))) (let ((.cse10 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (.cse9 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26))) (and (bvsgt (bvadd (bvneg .cse9) .cse10) (_ bv251658240 32)) (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse10) ((_ extract 30 23) .cse10) ((_ extract 22 0) .cse10)) (fp ((_ extract 31 31) .cse9) ((_ extract 30 23) .cse9) ((_ extract 22 0) .cse9))) |ULTIMATE.start___ieee754_hypotf_#res|) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) .cse8 (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_25 (_ BitVec 32))) (let ((.cse12 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26)) (.cse11 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse11) ((_ extract 30 23) .cse11) ((_ extract 22 0) .cse11)) (fp ((_ extract 31 31) .cse12) ((_ extract 30 23) .cse12) ((_ extract 22 0) .cse12))) ULTIMATE.start_isinf_float_~x) (bvsgt (bvadd (bvneg .cse12) .cse11) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (= (fp ((_ extract 31 31) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 30 23) ULTIMATE.start___ieee754_hypotf_~ha~0) ((_ extract 22 0) ULTIMATE.start___ieee754_hypotf_~ha~0)) ULTIMATE.start___ieee754_hypotf_~a~0) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_25 (_ BitVec 32))) (and (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32)) (v_ULTIMATE.start___ieee754_hypotf_~ha~0_25 (_ BitVec 32))) (let ((.cse14 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26)) (.cse13 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25))) (and (= (fp.add roundNearestTiesToEven (fp ((_ extract 31 31) .cse13) ((_ extract 30 23) .cse13) ((_ extract 22 0) .cse13)) (fp ((_ extract 31 31) .cse14) ((_ extract 30 23) .cse14) ((_ extract 22 0) .cse14))) (fp ((_ extract 31 31) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 30 23) ULTIMATE.start_isinf_float_~ix~1) ((_ extract 22 0) ULTIMATE.start_isinf_float_~ix~1))) (bvsgt (bvadd (bvneg .cse14) .cse13) (_ bv251658240 32)) (= (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_25)) (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)))))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~hb~0_26 (_ BitVec 32))) (= ULTIMATE.start___ieee754_hypotf_~hb~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~hb~0_26)))))) [2019-01-12 09:17:47,036 INFO L448 ceAbstractionStarter]: For program point L121(lines 121 144) no Hoare annotation was computed. [2019-01-12 09:17:47,036 INFO L448 ceAbstractionStarter]: For program point L121-1(lines 81 208) no Hoare annotation was computed. [2019-01-12 09:17:47,036 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 129) no Hoare annotation was computed. [2019-01-12 09:17:47,036 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:17:47,036 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 125) no Hoare annotation was computed. [2019-01-12 09:17:47,036 INFO L448 ceAbstractionStarter]: For program point L91-1(lines 91 95) no Hoare annotation was computed. [2019-01-12 09:17:47,037 INFO L448 ceAbstractionStarter]: For program point L124-2(lines 122 129) no Hoare annotation was computed. [2019-01-12 09:17:47,037 INFO L444 ceAbstractionStarter]: At program point L91-2(lines 91 95) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_hypotf_~x (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24))) (exists ((v_ULTIMATE.start___ieee754_hypotf_~ha~0_31 (_ BitVec 32))) (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) v_ULTIMATE.start___ieee754_hypotf_~ha~0_31) ((_ extract 30 23) v_ULTIMATE.start___ieee754_hypotf_~ha~0_31) ((_ extract 22 0) v_ULTIMATE.start___ieee754_hypotf_~ha~0_31))) (= ULTIMATE.start___ieee754_hypotf_~ha~0 (bvand (_ bv2147483647 32) v_ULTIMATE.start___ieee754_hypotf_~ha~0_31))))) [2019-01-12 09:17:47,037 INFO L448 ceAbstractionStarter]: For program point L91-3(lines 91 95) no Hoare annotation was computed. [2019-01-12 09:17:47,037 INFO L448 ceAbstractionStarter]: For program point L191-1(lines 191 195) no Hoare annotation was computed. [2019-01-12 09:17:47,037 INFO L444 ceAbstractionStarter]: At program point L191-2(lines 191 195) the Hoare annotation is: false [2019-01-12 09:17:47,037 INFO L448 ceAbstractionStarter]: For program point L191-3(lines 191 195) no Hoare annotation was computed. [2019-01-12 09:17:47,037 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 27) no Hoare annotation was computed. [2019-01-12 09:17:47,037 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 27) no Hoare annotation was computed. [2019-01-12 09:17:47,037 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 127) no Hoare annotation was computed. [2019-01-12 09:17:47,038 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 70) no Hoare annotation was computed. [2019-01-12 09:17:47,038 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:17:47,038 INFO L448 ceAbstractionStarter]: For program point L61-1(lines 61 70) no Hoare annotation was computed. [2019-01-12 09:17:47,038 INFO L448 ceAbstractionStarter]: For program point L161-1(lines 161 165) no Hoare annotation was computed. [2019-01-12 09:17:47,038 INFO L444 ceAbstractionStarter]: At program point L161-2(lines 161 165) the Hoare annotation is: false [2019-01-12 09:17:47,038 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 30) no Hoare annotation was computed. [2019-01-12 09:17:47,038 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 30) no Hoare annotation was computed. [2019-01-12 09:17:47,038 INFO L448 ceAbstractionStarter]: For program point L63(lines 63 69) no Hoare annotation was computed. [2019-01-12 09:17:47,038 INFO L448 ceAbstractionStarter]: For program point L63-2(lines 63 69) no Hoare annotation was computed. [2019-01-12 09:17:47,038 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 106) no Hoare annotation was computed. [2019-01-12 09:17:47,039 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 32) no Hoare annotation was computed. [2019-01-12 09:17:47,039 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 31 32) no Hoare annotation was computed. [2019-01-12 09:17:47,039 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 235) no Hoare annotation was computed. [2019-01-12 09:17:47,039 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 68) no Hoare annotation was computed. [2019-01-12 09:17:47,039 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:17:47,039 INFO L448 ceAbstractionStarter]: For program point L65-3(lines 65 68) no Hoare annotation was computed. [2019-01-12 09:17:47,039 INFO L448 ceAbstractionStarter]: For program point L166(lines 166 170) no Hoare annotation was computed. [2019-01-12 09:17:47,039 INFO L448 ceAbstractionStarter]: For program point L166-1(lines 157 171) no Hoare annotation was computed. [2019-01-12 09:17:47,040 INFO L448 ceAbstractionStarter]: For program point L200-1(lines 200 204) no Hoare annotation was computed. [2019-01-12 09:17:47,040 INFO L444 ceAbstractionStarter]: At program point L200-2(lines 200 204) the Hoare annotation is: false [2019-01-12 09:17:47,040 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 134 138) no Hoare annotation was computed. [2019-01-12 09:17:47,040 INFO L448 ceAbstractionStarter]: For program point L200-3(lines 200 204) no Hoare annotation was computed. [2019-01-12 09:17:47,040 INFO L444 ceAbstractionStarter]: At program point L134-2(lines 134 138) the Hoare annotation is: false [2019-01-12 09:17:47,040 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 39) no Hoare annotation was computed. [2019-01-12 09:17:47,048 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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:316) 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) [2019-01-12 09:17:47,055 INFO L168 Benchmark]: Toolchain (without parser) took 61143.23 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 289.4 MB). Free memory was 948.7 MB in the beginning and 1.3 GB in the end (delta: -314.7 MB). Peak memory consumption was 358.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:47,056 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:17:47,057 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.91 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:47,059 INFO L168 Benchmark]: Boogie Procedure Inliner took 210.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -202.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:47,060 INFO L168 Benchmark]: Boogie Preprocessor took 107.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:17:47,061 INFO L168 Benchmark]: RCFGBuilder took 6816.54 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: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:47,062 INFO L168 Benchmark]: TraceAbstraction took 53511.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.0 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:17:47,076 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 489.91 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 210.76 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -202.3 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 107.52 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 6816.54 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: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53511.81 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.0 MB). Peak memory consumption was 338.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 235]: 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 - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...