./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/float_req_bl_1232a_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_1232a_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 cd0c8f7b91fa815011541d5ffb41102d34132ba8 .................................................................................................................................................................................................................................................................................................................................................... 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_1232a_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 cd0c8f7b91fa815011541d5ffb41102d34132ba8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:16:35,462 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:16:35,464 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:16:35,482 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:16:35,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:16:35,485 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:16:35,487 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:16:35,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:16:35,492 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:16:35,495 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:16:35,498 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:16:35,499 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:16:35,500 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:16:35,501 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:16:35,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:16:35,506 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:16:35,506 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:16:35,508 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:16:35,519 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:16:35,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:16:35,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:16:35,527 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:16:35,532 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:16:35,534 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:16:35,534 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:16:35,535 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:16:35,539 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:16:35,540 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:16:35,542 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:16:35,543 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:16:35,543 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:16:35,543 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:16:35,544 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:16:35,544 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:16:35,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:16:35,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:16:35,546 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:35,562 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:16:35,562 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:16:35,563 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:16:35,563 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:16:35,564 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:16:35,567 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:16:35,567 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:16:35,567 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:16:35,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:16:35,569 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:16:35,569 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:16:35,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:16:35,569 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:16:35,570 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:16:35,570 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:16:35,570 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:16:35,570 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:16:35,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:16:35,571 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:16:35,571 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:16:35,571 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:16:35,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:35,571 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:16:35,572 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:16:35,572 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:16:35,572 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:16:35,572 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:16:35,572 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:16:35,572 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 -> cd0c8f7b91fa815011541d5ffb41102d34132ba8 [2019-01-12 09:16:35,622 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:16:35,638 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:16:35,642 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:16:35,643 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:16:35,644 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:16:35,644 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1232a_true-unreach-call.c [2019-01-12 09:16:35,700 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc13340a2/50c8b224e9254e18b469086c5ecf6950/FLAGe4d89c2b4 [2019-01-12 09:16:36,118 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:16:36,118 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1232a_true-unreach-call.c [2019-01-12 09:16:36,126 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc13340a2/50c8b224e9254e18b469086c5ecf6950/FLAGe4d89c2b4 [2019-01-12 09:16:36,490 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bc13340a2/50c8b224e9254e18b469086c5ecf6950 [2019-01-12 09:16:36,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:16:36,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:16:36,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:36,498 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:16:36,504 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:16:36,504 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:36" (1/1) ... [2019-01-12 09:16:36,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2181956a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:36, skipping insertion in model container [2019-01-12 09:16:36,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:36" (1/1) ... [2019-01-12 09:16:36,516 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:16:36,540 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:16:36,769 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:36,774 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:16:36,822 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:36,861 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:16:36,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:36 WrapperNode [2019-01-12 09:16:36,862 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:36,863 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:36,864 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:16:36,864 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:16:36,875 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:36" (1/1) ... [2019-01-12 09:16:36,893 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:36" (1/1) ... [2019-01-12 09:16:36,930 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:36,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:16:36,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:16:36,934 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:16:37,004 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:36" (1/1) ... [2019-01-12 09:16:37,005 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:36" (1/1) ... [2019-01-12 09:16:37,010 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:36" (1/1) ... [2019-01-12 09:16:37,011 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:36" (1/1) ... [2019-01-12 09:16:37,031 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:36" (1/1) ... [2019-01-12 09:16:37,043 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:36" (1/1) ... [2019-01-12 09:16:37,045 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:36" (1/1) ... [2019-01-12 09:16:37,054 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:16:37,054 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:16:37,055 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:16:37,055 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:16:37,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:36" (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:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:16:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:16:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:16:37,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:16:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:16:37,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:16:37,654 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:16:37,654 INFO L286 CfgBuilder]: Removed 18 assue(true) statements. [2019-01-12 09:16:37,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:37 BoogieIcfgContainer [2019-01-12 09:16:37,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:16:37,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:16:37,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:16:37,660 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:16:37,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:16:36" (1/3) ... [2019-01-12 09:16:37,661 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7247a68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:37, skipping insertion in model container [2019-01-12 09:16:37,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:36" (2/3) ... [2019-01-12 09:16:37,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7247a68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:37, skipping insertion in model container [2019-01-12 09:16:37,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:37" (3/3) ... [2019-01-12 09:16:37,664 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a_true-unreach-call.c [2019-01-12 09:16:37,674 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:16:37,686 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:16:37,704 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:16:37,732 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:16:37,733 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:16:37,733 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:16:37,733 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:16:37,734 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:16:37,734 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:16:37,734 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:16:37,734 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:16:37,734 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:16:37,748 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-01-12 09:16:37,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:16:37,754 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:37,755 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:37,757 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:37,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-01-12 09:16:37,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:37,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:37,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:37,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:37,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:37,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:37,868 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:37,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:37,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:16:37,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:16:37,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:16:37,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:37,893 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-01-12 09:16:37,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:37,910 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-01-12 09:16:37,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:16:37,911 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:16:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:37,921 INFO L225 Difference]: With dead ends: 62 [2019-01-12 09:16:37,921 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:16:37,924 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:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:16:37,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 09:16:37,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:16:37,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-01-12 09:16:37,960 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-01-12 09:16:37,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:37,960 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-01-12 09:16:37,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:16:37,960 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-01-12 09:16:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:16:37,961 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:37,961 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:37,962 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:37,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:37,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-01-12 09:16:37,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:37,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:37,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:37,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:37,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:38,065 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:38,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:38,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:38,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:38,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:38,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:38,070 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-01-12 09:16:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:38,211 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-01-12 09:16:38,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:38,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-12 09:16:38,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:38,213 INFO L225 Difference]: With dead ends: 53 [2019-01-12 09:16:38,214 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 09:16:38,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 09:16:38,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-12 09:16:38,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 09:16:38,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-01-12 09:16:38,223 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-01-12 09:16:38,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:38,223 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-01-12 09:16:38,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:38,225 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-01-12 09:16:38,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:16:38,225 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:38,226 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:38,226 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:38,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:38,226 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-01-12 09:16:38,226 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:38,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:38,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:38,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:38,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:38,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:38,352 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:38,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:38,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:38,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:38,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:38,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:38,354 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-01-12 09:16:38,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:38,586 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-01-12 09:16:38,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:38,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 09:16:38,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:38,588 INFO L225 Difference]: With dead ends: 55 [2019-01-12 09:16:38,588 INFO L226 Difference]: Without dead ends: 46 [2019-01-12 09:16:38,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-12 09:16:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-01-12 09:16:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 09:16:38,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-01-12 09:16:38,597 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-01-12 09:16:38,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:38,599 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-01-12 09:16:38,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-01-12 09:16:38,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:16:38,600 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:38,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:38,600 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:38,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:38,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-01-12 09:16:38,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:16:38,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:16:38,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:38,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:38,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:16:38,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:16:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:16:38,677 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:16:38,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:16:38 BoogieIcfgContainer [2019-01-12 09:16:38,704 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:16:38,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:16:38,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:16:38,705 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:16:38,705 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:37" (3/4) ... [2019-01-12 09:16:38,709 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:16:38,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:16:38,710 INFO L168 Benchmark]: Toolchain (without parser) took 2216.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -102.3 MB). Peak memory consumption was 29.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:38,712 INFO L168 Benchmark]: CDTParser took 0.15 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:16:38,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.50 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:38,714 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.38 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:38,715 INFO L168 Benchmark]: Boogie Preprocessor took 123.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:38,716 INFO L168 Benchmark]: RCFGBuilder took 601.56 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:38,716 INFO L168 Benchmark]: TraceAbstraction took 1047.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:38,717 INFO L168 Benchmark]: Witness Printer took 5.29 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:38,722 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.15 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 365.50 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.38 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 601.56 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: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1047.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * Witness Printer took 5.29 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 70]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 69, overapproximation of someUnaryFLOAToperation at line 65. Possible FailurePath: [L64] float x = 0.0f; [L65] float y = -0.0f; [L13] __uint32_t w; [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; [L66] float res = fmin_float(x, y); [L69] EXPR res == -0.0f && __signbit_float(res) == 1 [L69] COND TRUE !(res == -0.0f && __signbit_float(res) == 1) [L70] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. UNSAFE Result, 0.9s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, 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:41,088 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:16:41,090 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:16:41,106 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:16:41,107 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:16:41,109 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:16:41,110 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:16:41,113 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:16:41,114 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:16:41,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:16:41,119 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:16:41,119 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:16:41,121 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:16:41,122 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:16:41,126 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:16:41,127 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:16:41,135 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:16:41,137 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:16:41,140 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:16:41,142 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:16:41,144 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:16:41,147 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:16:41,150 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:16:41,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:16:41,152 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:16:41,153 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:16:41,155 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:16:41,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:16:41,160 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:16:41,163 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:16:41,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:16:41,164 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:16:41,165 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:16:41,165 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:16:41,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:16:41,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:16:41,167 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:41,194 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:16:41,194 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:16:41,195 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:16:41,196 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:16:41,201 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:16:41,201 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:16:41,201 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:16:41,202 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:16:41,202 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:16:41,202 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:16:41,202 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:16:41,202 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:16:41,202 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:16:41,203 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:16:41,203 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:16:41,203 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:16:41,203 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:16:41,203 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:16:41,203 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:16:41,204 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:16:41,205 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:16:41,205 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:16:41,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:16:41,206 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:16:41,206 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:16:41,206 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:16:41,206 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:16:41,206 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:16:41,206 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:16:41,207 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:16:41,207 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 -> cd0c8f7b91fa815011541d5ffb41102d34132ba8 [2019-01-12 09:16:41,268 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:16:41,284 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:16:41,289 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:16:41,291 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:16:41,291 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:16:41,292 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/float_req_bl_1232a_true-unreach-call.c [2019-01-12 09:16:41,340 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afca7c4b/b6571c463d36428c918d6063c24b5725/FLAGe9c89f021 [2019-01-12 09:16:41,774 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:16:41,775 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/float_req_bl_1232a_true-unreach-call.c [2019-01-12 09:16:41,780 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afca7c4b/b6571c463d36428c918d6063c24b5725/FLAGe9c89f021 [2019-01-12 09:16:42,156 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4afca7c4b/b6571c463d36428c918d6063c24b5725 [2019-01-12 09:16:42,160 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:16:42,161 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:16:42,162 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:42,162 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:16:42,166 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:16:42,167 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:42" (1/1) ... [2019-01-12 09:16:42,170 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d054b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:42, skipping insertion in model container [2019-01-12 09:16:42,170 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:16:42" (1/1) ... [2019-01-12 09:16:42,178 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:16:42,199 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:16:42,404 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:42,414 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:16:42,462 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:16:42,499 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:16:42,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:42 WrapperNode [2019-01-12 09:16:42,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:16:42,500 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:42,500 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:16:42,500 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:16:42,507 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:42" (1/1) ... [2019-01-12 09:16:42,518 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:42" (1/1) ... [2019-01-12 09:16:42,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:16:42,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:16:42,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:16:42,543 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:16:42,551 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:42" (1/1) ... [2019-01-12 09:16:42,551 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:42" (1/1) ... [2019-01-12 09:16:42,614 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:42" (1/1) ... [2019-01-12 09:16:42,614 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:42" (1/1) ... [2019-01-12 09:16:42,628 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:42" (1/1) ... [2019-01-12 09:16:42,634 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:42" (1/1) ... [2019-01-12 09:16:42,637 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:42" (1/1) ... [2019-01-12 09:16:42,641 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:16:42,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:16:42,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:16:42,642 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:16:42,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:42" (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:42,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:16:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:16:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:16:42,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:16:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-01-12 09:16:42,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:16:42,875 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:43,067 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:43,200 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:16:43,237 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:16:43,237 INFO L286 CfgBuilder]: Removed 18 assue(true) statements. [2019-01-12 09:16:43,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:43 BoogieIcfgContainer [2019-01-12 09:16:43,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:16:43,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:16:43,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:16:43,246 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:16:43,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:16:42" (1/3) ... [2019-01-12 09:16:43,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2353bd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:43, skipping insertion in model container [2019-01-12 09:16:43,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:16:42" (2/3) ... [2019-01-12 09:16:43,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2353bd0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:16:43, skipping insertion in model container [2019-01-12 09:16:43,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:16:43" (3/3) ... [2019-01-12 09:16:43,251 INFO L112 eAbstractionObserver]: Analyzing ICFG float_req_bl_1232a_true-unreach-call.c [2019-01-12 09:16:43,260 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:16:43,269 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:16:43,285 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:16:43,322 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:16:43,323 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:16:43,323 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:16:43,324 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:16:43,324 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:16:43,324 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:16:43,324 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:16:43,324 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:16:43,324 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:16:43,338 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-01-12 09:16:43,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-12 09:16:43,344 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:43,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:43,348 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:43,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:43,353 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-01-12 09:16:43,357 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:43,357 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:43,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:43,417 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:43,428 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:43,429 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:43,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:43,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:16:43,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:16:43,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:16:43,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:16:43,469 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-01-12 09:16:43,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:43,489 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-01-12 09:16:43,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:16:43,491 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-01-12 09:16:43,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:43,503 INFO L225 Difference]: With dead ends: 62 [2019-01-12 09:16:43,503 INFO L226 Difference]: Without dead ends: 29 [2019-01-12 09:16:43,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:43,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-01-12 09:16:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-01-12 09:16:43,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-12 09:16:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-01-12 09:16:43,543 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-01-12 09:16:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:43,543 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-01-12 09:16:43,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:16:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-01-12 09:16:43,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:16:43,545 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:43,545 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:43,545 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:43,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:43,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-01-12 09:16:43,546 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:43,546 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:43,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:43,592 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:43,653 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:43,654 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:43,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:43,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:43,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:43,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:43,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:43,666 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-01-12 09:16:43,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:43,933 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-01-12 09:16:43,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:43,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-01-12 09:16:43,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:43,936 INFO L225 Difference]: With dead ends: 53 [2019-01-12 09:16:43,937 INFO L226 Difference]: Without dead ends: 44 [2019-01-12 09:16:43,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:43,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-12 09:16:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-01-12 09:16:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-12 09:16:43,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-01-12 09:16:43,951 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-01-12 09:16:43,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:43,951 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-01-12 09:16:43,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:43,956 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-01-12 09:16:43,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:16:43,956 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:43,957 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:43,957 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:43,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:43,958 INFO L82 PathProgramCache]: Analyzing trace with hash 502201410, now seen corresponding path program 1 times [2019-01-12 09:16:43,959 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:43,960 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) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:43,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:44,026 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:44,085 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:44,085 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:44,096 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:44,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:44,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:44,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:44,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:44,098 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-01-12 09:16:44,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:44,258 INFO L93 Difference]: Finished difference Result 50 states and 67 transitions. [2019-01-12 09:16:44,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:44,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-12 09:16:44,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:44,260 INFO L225 Difference]: With dead ends: 50 [2019-01-12 09:16:44,260 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:16:44,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:44,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:16:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:16:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:16:44,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-01-12 09:16:44,268 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 12 [2019-01-12 09:16:44,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:44,268 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-01-12 09:16:44,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:44,269 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-01-12 09:16:44,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-01-12 09:16:44,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:44,271 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:44,272 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:44,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:44,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-01-12 09:16:44,273 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:44,274 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:16:44,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:44,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:44,497 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:44,497 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:44,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:44,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:16:44,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:16:44,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:16:44,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:16:44,514 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 4 states. [2019-01-12 09:16:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:44,688 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2019-01-12 09:16:44,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:16:44,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-01-12 09:16:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:44,690 INFO L225 Difference]: With dead ends: 48 [2019-01-12 09:16:44,690 INFO L226 Difference]: Without dead ends: 39 [2019-01-12 09:16:44,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:44,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-12 09:16:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 28. [2019-01-12 09:16:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:16:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2019-01-12 09:16:44,699 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 16 [2019-01-12 09:16:44,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:44,699 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2019-01-12 09:16:44,699 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:16:44,700 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2019-01-12 09:16:44,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:16:44,700 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:44,701 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:44,701 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:44,701 INFO L82 PathProgramCache]: Analyzing trace with hash 874935118, now seen corresponding path program 1 times [2019-01-12 09:16:44,702 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:44,702 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:16:44,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:44,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:44,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:44,824 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:44,824 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:44,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:44,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 09:16:44,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:16:44,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:16:44,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:16:44,836 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 5 states. [2019-01-12 09:16:44,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:44,980 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2019-01-12 09:16:44,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:16:44,982 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-01-12 09:16:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:44,983 INFO L225 Difference]: With dead ends: 39 [2019-01-12 09:16:44,983 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 09:16:44,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:16:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 09:16:44,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 09:16:44,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 09:16:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-01-12 09:16:44,991 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2019-01-12 09:16:44,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:44,991 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-01-12 09:16:44,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:16:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-01-12 09:16:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:16:44,993 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:44,994 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:44,994 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:44,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:44,994 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-01-12 09:16:44,995 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:44,996 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:16:45,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:45,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:45,074 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:45,075 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:45,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:45,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:16:45,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:16:45,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:16:45,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:16:45,086 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 3 states. [2019-01-12 09:16:45,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:45,103 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-01-12 09:16:45,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:16:45,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-12 09:16:45,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:45,105 INFO L225 Difference]: With dead ends: 33 [2019-01-12 09:16:45,105 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 09:16:45,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:16:45,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 09:16:45,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 09:16:45,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 09:16:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-01-12 09:16:45,112 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2019-01-12 09:16:45,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:45,113 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-01-12 09:16:45,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:16:45,113 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-01-12 09:16:45,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:16:45,114 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:45,115 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:16:45,115 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:45,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:45,115 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-01-12 09:16:45,116 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:45,116 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:16:45,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:45,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:45,177 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:45,576 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 1 [2019-01-12 09:16:45,578 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:45,578 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:45,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:45,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:16:45,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:16:45,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:16:45,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:16:45,590 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 6 states. [2019-01-12 09:16:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:45,706 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2019-01-12 09:16:45,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:16:45,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-01-12 09:16:45,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:45,708 INFO L225 Difference]: With dead ends: 26 [2019-01-12 09:16:45,708 INFO L226 Difference]: Without dead ends: 23 [2019-01-12 09:16:45,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:16:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-12 09:16:45,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-01-12 09:16:45,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-12 09:16:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 22 transitions. [2019-01-12 09:16:45,715 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 22 transitions. Word has length 18 [2019-01-12 09:16:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:45,715 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 22 transitions. [2019-01-12 09:16:45,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:16:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 22 transitions. [2019-01-12 09:16:45,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:16:45,716 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:16:45,716 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] [2019-01-12 09:16:45,716 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:16:45,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:16:45,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-01-12 09:16:45,718 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:16:45,718 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-01-12 09:16:45,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:16:45,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:16:45,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:16:45,966 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:45,967 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:16:45,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:16:45,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:16:45,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:16:45,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:16:45,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-12 09:16:45,981 INFO L87 Difference]: Start difference. First operand 23 states and 22 transitions. Second operand 10 states. [2019-01-12 09:16:46,319 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2019-01-12 09:16:46,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:16:46,372 INFO L93 Difference]: Finished difference Result 23 states and 22 transitions. [2019-01-12 09:16:46,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:16:46,374 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-01-12 09:16:46,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:16:46,375 INFO L225 Difference]: With dead ends: 23 [2019-01-12 09:16:46,375 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:16:46,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-01-12 09:16:46,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:16:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:16:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:16:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:16:46,378 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-01-12 09:16:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:16:46,378 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:16:46,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:16:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:16:46,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:16:46,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:16:46,603 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-01-12 09:16:46,720 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-12 09:16:46,868 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-01-12 09:16:46,868 INFO L448 ceAbstractionStarter]: For program point L36(lines 36 37) no Hoare annotation was computed. [2019-01-12 09:16:46,868 INFO L448 ceAbstractionStarter]: For program point L69-2(lines 69 72) no Hoare annotation was computed. [2019-01-12 09:16:46,869 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:16:46,869 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:16:46,870 INFO L444 ceAbstractionStarter]: At program point L53(lines 44 54) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= (fp ((_ extract 31 31) ULTIMATE.start___signbit_float_~w~1) ((_ extract 30 23) ULTIMATE.start___signbit_float_~w~1) ((_ extract 22 0) ULTIMATE.start___signbit_float_~w~1)) .cse0) (= ULTIMATE.start___fpclassify_float_~x .cse0) (= (_ bv1 32) |ULTIMATE.start___signbit_float_#res|) (= ULTIMATE.start_fmin_float_~y .cse0) (= (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)) .cse0) |ULTIMATE.start_main_#t~short9| (= |ULTIMATE.start_fmin_float_#res| .cse0) (= ULTIMATE.start_main_~res~0 .cse0) (= (_ +zero 8 24) ULTIMATE.start_fmin_float_~x) (= ULTIMATE.start___signbit_float_~x .cse0))) [2019-01-12 09:16:46,870 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 09:16:46,870 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2019-01-12 09:16:46,870 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2019-01-12 09:16:46,870 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2019-01-12 09:16:46,870 INFO L448 ceAbstractionStarter]: For program point L47-1(lines 47 51) no Hoare annotation was computed. [2019-01-12 09:16:46,871 INFO L444 ceAbstractionStarter]: At program point L47-2(lines 47 51) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= ULTIMATE.start___fpclassify_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0) (= (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)) .cse0) |ULTIMATE.start_main_#t~short9| (= |ULTIMATE.start_fmin_float_#res| .cse0) (= ULTIMATE.start_main_~res~0 .cse0) (= (_ +zero 8 24) ULTIMATE.start_fmin_float_~x) (= ULTIMATE.start___signbit_float_~x .cse0))) [2019-01-12 09:16:46,871 INFO L448 ceAbstractionStarter]: For program point L47-3(lines 47 51) no Hoare annotation was computed. [2019-01-12 09:16:46,871 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-01-12 09:16:46,871 INFO L448 ceAbstractionStarter]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-01-12 09:16:46,871 INFO L448 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2019-01-12 09:16:46,871 INFO L444 ceAbstractionStarter]: At program point L15-2(lines 15 19) the Hoare annotation is: (and (= ULTIMATE.start___fpclassify_float_~x (_ +zero 8 24)) (= ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24))) (= (_ +zero 8 24) ULTIMATE.start_fmin_float_~x)) [2019-01-12 09:16:46,871 INFO L448 ceAbstractionStarter]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2019-01-12 09:16:46,872 INFO L448 ceAbstractionStarter]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2019-01-12 09:16:46,873 INFO L444 ceAbstractionStarter]: At program point L15-6(lines 15 19) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= ULTIMATE.start___fpclassify_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0) (= (_ +zero 8 24) ULTIMATE.start_fmin_float_~x))) [2019-01-12 09:16:46,873 INFO L448 ceAbstractionStarter]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2019-01-12 09:16:46,873 INFO L444 ceAbstractionStarter]: At program point L32(lines 12 33) the Hoare annotation is: (and (= ULTIMATE.start___fpclassify_float_~x (_ +zero 8 24)) (= (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)) (_ +zero 8 24)) (= ULTIMATE.start_fmin_float_~y (fp.neg (_ +zero 8 24))) (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967294 32)) (_ bv0 32)) (= (_ +zero 8 24) ULTIMATE.start_fmin_float_~x)) [2019-01-12 09:16:46,873 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:16:46,874 INFO L444 ceAbstractionStarter]: At program point L32-1(lines 12 33) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= ULTIMATE.start___fpclassify_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0) (= (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)) .cse0) (= (bvadd |ULTIMATE.start___fpclassify_float_#res| (_ bv4294967294 32)) (_ bv0 32)) (= (_ +zero 8 24) ULTIMATE.start_fmin_float_~x))) [2019-01-12 09:16:46,874 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2019-01-12 09:16:46,874 INFO L451 ceAbstractionStarter]: At program point L74(lines 56 75) the Hoare annotation is: true [2019-01-12 09:16:46,874 INFO L448 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-01-12 09:16:46,874 INFO L448 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2019-01-12 09:16:46,874 INFO L444 ceAbstractionStarter]: At program point L41-3(lines 35 42) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 8 24)))) (and (= ULTIMATE.start___fpclassify_float_~x .cse0) (= ULTIMATE.start_fmin_float_~y .cse0) (= (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)) .cse0) (= |ULTIMATE.start_fmin_float_#res| .cse0) (= (_ +zero 8 24) ULTIMATE.start_fmin_float_~x))) [2019-01-12 09:16:46,875 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:16:46,875 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2019-01-12 09:16:46,875 INFO L448 ceAbstractionStarter]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2019-01-12 09:16:46,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:16:46 BoogieIcfgContainer [2019-01-12 09:16:46,906 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:16:46,907 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:16:46,907 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:16:46,907 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:16:46,908 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:43" (3/4) ... [2019-01-12 09:16:46,915 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:16:46,931 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-01-12 09:16:46,932 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-01-12 09:16:46,933 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:16:46,961 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((x == ~Pluszero~LONGDOUBLE() && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~Pluszero~LONGDOUBLE()) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967294bv32) == 0bv32) && ~Pluszero~LONGDOUBLE() == x [2019-01-12 09:16:46,961 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x [2019-01-12 09:16:46,962 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) [2019-01-12 09:16:46,962 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967294bv32) == 0bv32) && ~Pluszero~LONGDOUBLE() == x [2019-01-12 09:16:46,963 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && 1bv32 == \result) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) [2019-01-12 09:16:47,008 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:16:47,008 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:16:47,011 INFO L168 Benchmark]: Toolchain (without parser) took 4848.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 948.7 MB in the beginning and 921.2 MB in the end (delta: 27.5 MB). Peak memory consumption was 169.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:47,014 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:16:47,016 INFO L168 Benchmark]: CACSL2BoogieTranslator took 337.75 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:47,016 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.02 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:47,017 INFO L168 Benchmark]: Boogie Preprocessor took 98.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:47,021 INFO L168 Benchmark]: RCFGBuilder took 599.78 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:47,022 INFO L168 Benchmark]: TraceAbstraction took 3664.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 927.8 MB in the end (delta: 183.5 MB). Peak memory consumption was 183.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:47,022 INFO L168 Benchmark]: Witness Printer took 101.26 ms. Allocated memory is still 1.2 GB. Free memory was 927.8 MB in the beginning and 921.2 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:16:47,031 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 337.75 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 937.9 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.02 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 932.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 932.5 MB in the beginning and 1.1 GB in the end (delta: -198.1 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 599.78 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: 19.3 MB). Peak memory consumption was 19.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3664.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 927.8 MB in the end (delta: 183.5 MB). Peak memory consumption was 183.5 MB. Max. memory is 11.5 GB. * Witness Printer took 101.26 ms. Allocated memory is still 1.2 GB. Free memory was 927.8 MB in the beginning and 921.2 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967294bv32) == 0bv32) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 44]: Loop Invariant Derived loop invariant: ((((((((~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && 1bv32 == \result) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((x == ~Pluszero~LONGDOUBLE() && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~Pluszero~LONGDOUBLE()) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967294bv32) == 0bv32) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (x == ~Pluszero~LONGDOUBLE() && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && aux-res == -0.0f && __signbit_float(res) == 1-aux) && \result == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (x == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. SAFE Result, 3.5s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 226 SDtfs, 141 SDslu, 293 SDs, 0 SdLazy, 124 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 185 HoareAnnotationTreeSize, 8 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 124 NumberOfCodeBlocks, 124 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 6083 SizeOfPredicates, 35 NumberOfNonLiveVariables, 381 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...