./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_1250_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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/double_req_bl_1250_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 01b6390e563edc58f3f7d1f239b082df891f9006 ........................................................................................................................................................................................................................................................................................................................................................ 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/double_req_bl_1250_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 01b6390e563edc58f3f7d1f239b082df891f9006 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:58:51,538 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:51,540 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:51,552 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:51,552 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:51,553 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:51,555 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:51,557 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:51,559 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:51,560 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:51,561 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:51,561 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:51,562 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:51,563 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:51,564 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:51,565 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:51,566 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:51,568 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:51,571 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:51,572 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:51,574 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:51,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:51,578 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:51,578 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:51,579 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:51,580 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:51,581 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:51,582 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:51,583 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:51,584 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:51,584 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:51,585 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:51,585 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:51,586 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:51,587 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:51,588 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:51,588 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:58:51,605 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:51,605 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:51,606 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:51,606 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:51,607 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:51,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:51,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:51,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:58:51,608 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:51,608 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:51,608 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:51,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:51,609 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:51,609 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:51,609 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:51,609 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:51,610 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:51,610 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:51,610 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:51,610 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:51,611 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:51,611 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:51,611 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:51,611 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:51,611 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:51,612 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:58:51,612 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:51,612 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:58:51,612 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 -> 01b6390e563edc58f3f7d1f239b082df891f9006 [2018-12-31 03:58:51,662 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:51,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:51,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:51,686 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:51,686 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:51,688 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-12-31 03:58:51,757 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/466565b5e/8e756e26fd274299991011914d9418ca/FLAGe121c2036 [2018-12-31 03:58:52,208 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:52,209 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-12-31 03:58:52,215 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/466565b5e/8e756e26fd274299991011914d9418ca/FLAGe121c2036 [2018-12-31 03:58:52,554 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/466565b5e/8e756e26fd274299991011914d9418ca [2018-12-31 03:58:52,562 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:52,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:52,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:52,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:52,574 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:52,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:52" (1/1) ... [2018-12-31 03:58:52,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da98c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52, skipping insertion in model container [2018-12-31 03:58:52,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:52" (1/1) ... [2018-12-31 03:58:52,586 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:52,606 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:58:52,877 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:52,882 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:58:52,915 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:52,939 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:58:52,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52 WrapperNode [2018-12-31 03:58:52,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:52,940 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:52,940 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:58:52,941 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:58:52,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52" (1/1) ... [2018-12-31 03:58:52,960 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52" (1/1) ... [2018-12-31 03:58:52,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:52,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:58:52,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:58:52,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:58:53,002 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52" (1/1) ... [2018-12-31 03:58:53,002 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52" (1/1) ... [2018-12-31 03:58:53,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52" (1/1) ... [2018-12-31 03:58:53,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52" (1/1) ... [2018-12-31 03:58:53,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52" (1/1) ... [2018-12-31 03:58:53,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52" (1/1) ... [2018-12-31 03:58:53,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52" (1/1) ... [2018-12-31 03:58:53,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:58:53,107 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:58:53,107 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:58:53,107 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:58:53,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52" (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 [2018-12-31 03:58:53,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:58:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:58:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:58:53,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:58:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:58:53,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:58:53,730 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:58:53,731 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 03:58:53,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:53 BoogieIcfgContainer [2018-12-31 03:58:53,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:58:53,732 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:58:53,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:58:53,736 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:58:53,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:52" (1/3) ... [2018-12-31 03:58:53,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175ac480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:53, skipping insertion in model container [2018-12-31 03:58:53,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:52" (2/3) ... [2018-12-31 03:58:53,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@175ac480 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:53, skipping insertion in model container [2018-12-31 03:58:53,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:53" (3/3) ... [2018-12-31 03:58:53,740 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250_true-unreach-call.c [2018-12-31 03:58:53,750 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:58:53,759 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:58:53,778 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:58:53,810 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:58:53,811 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:58:53,811 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:58:53,811 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:58:53,811 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:58:53,811 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:58:53,812 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:58:53,812 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:58:53,812 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:58:53,826 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 03:58:53,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:58:53,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:53,833 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:53,835 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2018-12-31 03:58:53,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:53,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:53,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:53,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:53,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:53,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:53,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:53,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:58:53,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:58:53,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:58:53,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:53,974 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-12-31 03:58:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:53,995 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-12-31 03:58:53,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:58:53,997 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 03:58:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:54,009 INFO L225 Difference]: With dead ends: 54 [2018-12-31 03:58:54,009 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 03:58:54,013 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 [2018-12-31 03:58:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 03:58:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-31 03:58:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 03:58:54,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-12-31 03:58:54,051 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2018-12-31 03:58:54,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:54,051 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-31 03:58:54,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:58:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-12-31 03:58:54,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:58:54,052 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:54,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:54,053 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:54,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:54,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2018-12-31 03:58:54,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:54,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:54,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:54,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:54,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:54,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:54,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:54,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:54,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:54,178 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-12-31 03:58:54,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:54,376 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-12-31 03:58:54,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:54,377 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 03:58:54,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:54,378 INFO L225 Difference]: With dead ends: 41 [2018-12-31 03:58:54,378 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:58:54,379 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 [2018-12-31 03:58:54,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:58:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 03:58:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:58:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:58:54,387 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2018-12-31 03:58:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:54,387 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:58:54,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:54,388 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:58:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:58:54,388 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:54,388 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:54,390 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:54,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:54,390 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2018-12-31 03:58:54,391 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:54,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:54,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:54,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:54,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:54,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:54,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:54,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:54,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:54,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:54,518 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 03:58:54,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:54,799 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 03:58:54,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:54,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 03:58:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:54,802 INFO L225 Difference]: With dead ends: 43 [2018-12-31 03:58:54,803 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:54,803 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 [2018-12-31 03:58:54,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:54,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 03:58:54,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:58:54,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:58:54,809 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-31 03:58:54,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:54,809 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:58:54,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:54,810 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:58:54,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:58:54,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:54,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:54,811 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:54,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:54,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2018-12-31 03:58:54,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:54,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:54,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:54,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:54,907 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:58:54,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:58:54 BoogieIcfgContainer [2018-12-31 03:58:54,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:58:54,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:58:54,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:58:54,941 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:58:54,942 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:53" (3/4) ... [2018-12-31 03:58:54,946 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:58:54,947 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:58:54,947 INFO L168 Benchmark]: Toolchain (without parser) took 2385.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -84.0 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:54,950 INFO L168 Benchmark]: CDTParser took 0.40 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. [2018-12-31 03:58:54,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.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. [2018-12-31 03:58:54,951 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.79 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. [2018-12-31 03:58:54,952 INFO L168 Benchmark]: Boogie Preprocessor took 116.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:54,953 INFO L168 Benchmark]: RCFGBuilder took 624.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:54,954 INFO L168 Benchmark]: TraceAbstraction took 1208.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:54,955 INFO L168 Benchmark]: Witness Printer took 5.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:54,960 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.40 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 374.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 49.79 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 116.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 624.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.9 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1208.06 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 41.1 MB). Peak memory consumption was 41.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.64 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 72]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 16, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67. Possible FailurePath: [L67] double x = 0.0 / 0.0; [L68] double y = 0.0 / 0.0; [L27] __uint32_t msw, lsw; [L30] ieee_double_shape_type ew_u; [L31] ew_u.value = (x) [L32] EXPR ew_u.parts.msw [L32] (msw) = ew_u.parts.msw [L33] EXPR ew_u.parts.lsw [L33] (lsw) = ew_u.parts.lsw [L36-L37] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L39-L40] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L42-L43] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L46-L47] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L50] return 0; [L55] COND TRUE __fpclassify_double(x) == 0 [L56] return y; [L69] double res = fmax_double(x, y); [L16] return x != x; [L71] COND TRUE !isnan_double(res) [L72] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. UNSAFE Result, 1.1s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 22 SDslu, 110 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.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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, 20 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-2e94e6a [2018-12-31 03:58:57,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:57,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:57,363 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:57,363 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:57,364 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:57,366 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:57,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:57,369 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:57,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:57,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:57,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:57,372 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:57,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:57,377 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:57,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:57,380 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:57,384 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:57,390 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:57,396 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:57,401 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:57,402 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:57,405 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:57,405 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:57,406 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:57,408 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:57,411 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:57,412 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:57,415 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:57,418 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:57,419 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:57,420 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:57,420 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:57,420 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:57,421 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:57,424 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:57,424 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:58:57,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:57,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:57,455 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:57,455 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:57,456 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:57,460 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:57,460 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:57,460 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:57,460 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:57,461 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:57,462 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:57,462 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:57,462 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:58:57,462 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:58:57,462 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:57,463 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:57,463 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:57,463 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:57,463 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:57,463 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:57,463 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:57,466 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:57,467 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:57,467 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:57,467 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:57,467 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:57,468 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:58:57,468 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:57,468 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:58:57,468 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:58:57,469 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 -> 01b6390e563edc58f3f7d1f239b082df891f9006 [2018-12-31 03:58:57,526 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:57,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:57,543 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:57,545 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:57,546 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:57,546 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-12-31 03:58:57,606 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f48ceefaf/e218a3f5728c4d2280d3e42a53886020/FLAG8c7382653 [2018-12-31 03:58:58,056 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:58,060 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1250_true-unreach-call.c [2018-12-31 03:58:58,068 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f48ceefaf/e218a3f5728c4d2280d3e42a53886020/FLAG8c7382653 [2018-12-31 03:58:58,419 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f48ceefaf/e218a3f5728c4d2280d3e42a53886020 [2018-12-31 03:58:58,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:58,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:58,426 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:58,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:58,431 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:58,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:58" (1/1) ... [2018-12-31 03:58:58,435 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aaead5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58, skipping insertion in model container [2018-12-31 03:58:58,435 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:58" (1/1) ... [2018-12-31 03:58:58,445 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:58,471 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:58:58,703 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:58,710 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:58:58,751 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:58,791 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:58:58,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58 WrapperNode [2018-12-31 03:58:58,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:58,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:58,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:58:58,793 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:58:58,803 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58" (1/1) ... [2018-12-31 03:58:58,818 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58" (1/1) ... [2018-12-31 03:58:58,858 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:58,858 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:58:58,859 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:58:58,859 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:58:58,936 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58" (1/1) ... [2018-12-31 03:58:58,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58" (1/1) ... [2018-12-31 03:58:58,940 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58" (1/1) ... [2018-12-31 03:58:58,940 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58" (1/1) ... [2018-12-31 03:58:58,951 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58" (1/1) ... [2018-12-31 03:58:58,957 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58" (1/1) ... [2018-12-31 03:58:58,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58" (1/1) ... [2018-12-31 03:58:58,965 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:58:58,966 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:58:58,966 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:58:58,966 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:58:58,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58" (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 [2018-12-31 03:58:59,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:58:59,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:58:59,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:58:59,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:58:59,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:58:59,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:58:59,319 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:59,624 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:59,687 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:58:59,687 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 03:58:59,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:59 BoogieIcfgContainer [2018-12-31 03:58:59,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:58:59,688 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:58:59,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:58:59,693 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:58:59,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:58" (1/3) ... [2018-12-31 03:58:59,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715e85f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:59, skipping insertion in model container [2018-12-31 03:58:59,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:58" (2/3) ... [2018-12-31 03:58:59,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@715e85f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:59, skipping insertion in model container [2018-12-31 03:58:59,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:59" (3/3) ... [2018-12-31 03:58:59,698 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250_true-unreach-call.c [2018-12-31 03:58:59,709 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:58:59,717 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:58:59,736 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:58:59,770 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:58:59,771 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:58:59,771 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:58:59,772 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:58:59,772 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:58:59,772 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:58:59,772 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:58:59,773 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:58:59,773 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:58:59,786 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-12-31 03:58:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:58:59,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:59,793 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:59,796 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:59,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:59,801 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2018-12-31 03:58:59,806 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:59,807 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) [2018-12-31 03:58:59,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:59,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:59,900 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:59,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:59,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:58:59,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:58:59,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:58:59,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:59,931 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-12-31 03:58:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:59,948 INFO L93 Difference]: Finished difference Result 54 states and 84 transitions. [2018-12-31 03:58:59,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:58:59,950 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 03:58:59,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:59,962 INFO L225 Difference]: With dead ends: 54 [2018-12-31 03:58:59,962 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 03:58:59,965 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 [2018-12-31 03:58:59,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 03:58:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-12-31 03:58:59,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 03:58:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2018-12-31 03:59:00,000 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2018-12-31 03:59:00,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:00,000 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2018-12-31 03:59:00,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:59:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2018-12-31 03:59:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:59:00,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:00,001 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:00,002 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:00,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:00,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2018-12-31 03:59:00,003 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:00,003 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) [2018-12-31 03:59:00,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:00,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:00,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:00,114 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:00,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:00,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:00,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:00,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:00,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:00,134 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2018-12-31 03:59:00,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:00,426 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2018-12-31 03:59:00,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:00,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 03:59:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:00,429 INFO L225 Difference]: With dead ends: 41 [2018-12-31 03:59:00,429 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:59:00,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:00,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:59:00,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 03:59:00,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:59:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:59:00,440 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2018-12-31 03:59:00,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:00,440 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:59:00,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:00,440 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:59:00,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:59:00,442 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:00,443 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:00,443 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:00,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:00,443 INFO L82 PathProgramCache]: Analyzing trace with hash 502183504, now seen corresponding path program 1 times [2018-12-31 03:59:00,445 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:00,445 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 [2018-12-31 03:59:00,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:00,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:00,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:00,612 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:00,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:00,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:00,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:00,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:00,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:00,625 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 03:59:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:00,761 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 03:59:00,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:00,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 03:59:00,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:00,763 INFO L225 Difference]: With dead ends: 43 [2018-12-31 03:59:00,763 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:59:00,764 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 [2018-12-31 03:59:00,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:59:00,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 03:59:00,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:59:00,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:59:00,770 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 [2018-12-31 03:59:00,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:00,770 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:59:00,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:00,771 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:59:00,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:59:00,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:00,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:00,772 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:00,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:00,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1951251627, now seen corresponding path program 1 times [2018-12-31 03:59:00,773 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:00,773 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 [2018-12-31 03:59:00,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:00,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:00,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:00,924 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:00,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:00,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:00,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:00,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:00,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:00,939 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 03:59:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:01,129 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 03:59:01,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:01,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-31 03:59:01,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:01,133 INFO L225 Difference]: With dead ends: 43 [2018-12-31 03:59:01,133 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:59:01,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:01,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:59:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 03:59:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:59:01,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:59:01,143 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 13 [2018-12-31 03:59:01,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:01,144 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:59:01,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:01,144 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:59:01,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:59:01,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:01,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:01,146 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:01,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:01,146 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2018-12-31 03:59:01,147 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:01,147 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 [2018-12-31 03:59:01,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:01,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:01,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:01,227 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:01,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:01,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:01,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:01,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:01,238 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2018-12-31 03:59:01,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:01,359 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2018-12-31 03:59:01,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:01,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 03:59:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:01,361 INFO L225 Difference]: With dead ends: 43 [2018-12-31 03:59:01,361 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:59:01,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:59:01,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 03:59:01,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:59:01,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2018-12-31 03:59:01,369 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2018-12-31 03:59:01,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:01,369 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2018-12-31 03:59:01,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:01,369 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2018-12-31 03:59:01,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:59:01,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:01,371 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:01,371 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:01,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:01,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2018-12-31 03:59:01,372 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:01,372 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 [2018-12-31 03:59:01,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:01,443 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:01,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:01,569 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:01,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:01,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:59:01,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:59:01,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:59:01,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:59:01,580 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 6 states. [2018-12-31 03:59:01,966 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 03:59:02,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:02,141 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-12-31 03:59:02,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:59:02,144 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-12-31 03:59:02,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:02,145 INFO L225 Difference]: With dead ends: 36 [2018-12-31 03:59:02,145 INFO L226 Difference]: Without dead ends: 27 [2018-12-31 03:59:02,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:59:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-12-31 03:59:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-12-31 03:59:02,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-31 03:59:02,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2018-12-31 03:59:02,153 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2018-12-31 03:59:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:02,154 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2018-12-31 03:59:02,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:59:02,154 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2018-12-31 03:59:02,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 03:59:02,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:02,155 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:02,155 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:02,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:02,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1012428811, now seen corresponding path program 1 times [2018-12-31 03:59:02,156 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:02,156 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 [2018-12-31 03:59:02,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:02,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:02,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:02,280 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:02,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:02,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:02,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:02,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:02,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:02,293 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 4 states. [2018-12-31 03:59:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:02,454 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-31 03:59:02,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:02,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-31 03:59:02,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:02,456 INFO L225 Difference]: With dead ends: 41 [2018-12-31 03:59:02,457 INFO L226 Difference]: Without dead ends: 36 [2018-12-31 03:59:02,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:02,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-31 03:59:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-12-31 03:59:02,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:59:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-31 03:59:02,463 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 16 [2018-12-31 03:59:02,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:02,464 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-31 03:59:02,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-31 03:59:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:59:02,466 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:02,466 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:02,466 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:02,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:02,467 INFO L82 PathProgramCache]: Analyzing trace with hash 874917212, now seen corresponding path program 1 times [2018-12-31 03:59:02,467 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:02,467 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 [2018-12-31 03:59:02,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:02,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:02,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:02,583 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:02,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:02,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:02,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:02,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:02,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:02,597 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 4 states. [2018-12-31 03:59:02,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:02,728 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2018-12-31 03:59:02,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:02,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-12-31 03:59:02,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:02,735 INFO L225 Difference]: With dead ends: 43 [2018-12-31 03:59:02,735 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:59:02,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:02,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:59:02,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2018-12-31 03:59:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:59:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2018-12-31 03:59:02,748 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 17 [2018-12-31 03:59:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:02,748 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2018-12-31 03:59:02,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:02,749 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2018-12-31 03:59:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:59:02,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:02,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:02,750 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:02,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:02,750 INFO L82 PathProgramCache]: Analyzing trace with hash -356841937, now seen corresponding path program 1 times [2018-12-31 03:59:02,750 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:02,751 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:02,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:02,836 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:02,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:02,939 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:02,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:02,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:59:02,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:59:02,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:59:02,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:59:02,951 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 7 states. [2018-12-31 03:59:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:03,182 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2018-12-31 03:59:03,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:59:03,184 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-12-31 03:59:03,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:03,184 INFO L225 Difference]: With dead ends: 32 [2018-12-31 03:59:03,184 INFO L226 Difference]: Without dead ends: 23 [2018-12-31 03:59:03,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:59:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-12-31 03:59:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-12-31 03:59:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 03:59:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2018-12-31 03:59:03,190 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 18 [2018-12-31 03:59:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:03,190 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2018-12-31 03:59:03,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:59:03,191 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2018-12-31 03:59:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:59:03,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:03,191 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:03,192 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:03,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:03,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1049576048, now seen corresponding path program 1 times [2018-12-31 03:59:03,192 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:03,193 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:03,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:03,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:03,293 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:03,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:03,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:03,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:03,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:03,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:03,305 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 4 states. [2018-12-31 03:59:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:03,408 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-31 03:59:03,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:03,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-31 03:59:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:03,412 INFO L225 Difference]: With dead ends: 32 [2018-12-31 03:59:03,413 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 03:59:03,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:03,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 03:59:03,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-31 03:59:03,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 03:59:03,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2018-12-31 03:59:03,418 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 18 [2018-12-31 03:59:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:03,418 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2018-12-31 03:59:03,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2018-12-31 03:59:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:59:03,419 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:03,419 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:03,419 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1983383519, now seen corresponding path program 1 times [2018-12-31 03:59:03,420 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:03,420 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:03,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:03,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:03,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:03,551 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:03,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:03,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:59:03,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:59:03,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:59:03,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:59:03,563 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 4 states. [2018-12-31 03:59:03,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:03,699 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2018-12-31 03:59:03,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:59:03,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-12-31 03:59:03,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:03,701 INFO L225 Difference]: With dead ends: 32 [2018-12-31 03:59:03,701 INFO L226 Difference]: Without dead ends: 25 [2018-12-31 03:59:03,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:59:03,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-31 03:59:03,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-12-31 03:59:03,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-12-31 03:59:03,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2018-12-31 03:59:03,706 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 19 [2018-12-31 03:59:03,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:03,706 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2018-12-31 03:59:03,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:59:03,706 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-12-31 03:59:03,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:59:03,707 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:59:03,707 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:59:03,707 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:59:03,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:59:03,708 INFO L82 PathProgramCache]: Analyzing trace with hash -208376157, now seen corresponding path program 1 times [2018-12-31 03:59:03,708 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:59:03,708 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-12-31 03:59:03,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:59:03,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:59:03,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:59:03,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:59:03,859 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:59:03,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:59:03,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:59:03,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:59:03,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:59:03,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:59:03,879 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand 6 states. [2018-12-31 03:59:04,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:59:04,012 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-12-31 03:59:04,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:59:04,012 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-12-31 03:59:04,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:59:04,012 INFO L225 Difference]: With dead ends: 23 [2018-12-31 03:59:04,013 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:59:04,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:59:04,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:59:04,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:59:04,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:59:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:59:04,014 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-12-31 03:59:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:59:04,014 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:59:04,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:59:04,014 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:59:04,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:59:04,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:59:04,372 INFO L448 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-12-31 03:59:04,372 INFO L448 ceAbstractionStarter]: For program point L60-2(line 60) no Hoare annotation was computed. [2018-12-31 03:59:04,373 INFO L444 ceAbstractionStarter]: At program point L60-3(lines 53 61) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= |ULTIMATE.start_fmax_double_#res| .cse0) (= ULTIMATE.start_fmax_double_~y .cse0))) [2018-12-31 03:59:04,373 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 72) no Hoare annotation was computed. [2018-12-31 03:59:04,373 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:59:04,373 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:59:04,374 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:59:04,374 INFO L448 ceAbstractionStarter]: For program point L57(lines 57 58) no Hoare annotation was computed. [2018-12-31 03:59:04,374 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= |ULTIMATE.start_fmax_double_#res| .cse0) (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (= ULTIMATE.start_fmax_double_~y .cse0))) [2018-12-31 03:59:04,374 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:59:04,374 INFO L448 ceAbstractionStarter]: For program point L29-1(lines 29 34) no Hoare annotation was computed. [2018-12-31 03:59:04,374 INFO L444 ceAbstractionStarter]: At program point L29-2(lines 29 34) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmax_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y .cse0))) [2018-12-31 03:59:04,374 INFO L448 ceAbstractionStarter]: For program point L29-3(lines 26 51) no Hoare annotation was computed. [2018-12-31 03:59:04,375 INFO L448 ceAbstractionStarter]: For program point L29-5(lines 29 34) no Hoare annotation was computed. [2018-12-31 03:59:04,375 INFO L444 ceAbstractionStarter]: At program point L29-6(lines 29 34) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmax_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y .cse0))) [2018-12-31 03:59:04,375 INFO L448 ceAbstractionStarter]: For program point L29-7(lines 26 51) no Hoare annotation was computed. [2018-12-31 03:59:04,375 INFO L444 ceAbstractionStarter]: At program point L50(lines 26 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmax_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y .cse0))) [2018-12-31 03:59:04,375 INFO L444 ceAbstractionStarter]: At program point L50-1(lines 26 51) the Hoare annotation is: (let ((.cse1 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (let ((.cse0 (= ULTIMATE.start_fmax_double_~y .cse1))) (or (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967295 32)) (_ bv0 32))) (and (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967292 32)) (_ bv0 32)) .cse0) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967293 32)) (_ bv0 32))) (and (= ULTIMATE.start_fmax_double_~x .cse1) .cse0) (and (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967294 32)) (_ bv0 32)) .cse0)))) [2018-12-31 03:59:04,375 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 50) no Hoare annotation was computed. [2018-12-31 03:59:04,376 INFO L448 ceAbstractionStarter]: For program point L46-1(lines 46 50) no Hoare annotation was computed. [2018-12-31 03:59:04,376 INFO L451 ceAbstractionStarter]: At program point L75(lines 63 76) the Hoare annotation is: true [2018-12-31 03:59:04,376 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 50) no Hoare annotation was computed. [2018-12-31 03:59:04,376 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 42 50) no Hoare annotation was computed. [2018-12-31 03:59:04,376 INFO L448 ceAbstractionStarter]: For program point L71(lines 71 74) no Hoare annotation was computed. [2018-12-31 03:59:04,376 INFO L448 ceAbstractionStarter]: For program point L55(lines 55 56) no Hoare annotation was computed. [2018-12-31 03:59:04,376 INFO L448 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-12-31 03:59:04,376 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 50) no Hoare annotation was computed. [2018-12-31 03:59:04,377 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 39 50) no Hoare annotation was computed. [2018-12-31 03:59:04,385 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,390 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,391 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,393 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,393 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,395 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,395 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,396 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,396 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,398 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,398 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,398 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,398 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,399 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,399 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,400 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,400 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,400 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,400 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,401 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,401 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,401 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,402 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:59:04 BoogieIcfgContainer [2018-12-31 03:59:04,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:59:04,405 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:59:04,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:59:04,406 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:59:04,406 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:59" (3/4) ... [2018-12-31 03:59:04,410 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:59:04,425 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-12-31 03:59:04,425 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 03:59:04,426 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 03:59:04,460 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:04,460 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2018-12-31 03:59:04,461 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32) || (~bvadd64(\result, 4294967292bv32) == 0bv32 && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967293bv32) == 0bv32)) || (x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967294bv32) == 0bv32 && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2018-12-31 03:59:04,510 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:59:04,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:59:04,511 INFO L168 Benchmark]: Toolchain (without parser) took 6087.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 951.4 MB in the beginning and 839.7 MB in the end (delta: 111.6 MB). Peak memory consumption was 248.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:04,513 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. [2018-12-31 03:59:04,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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. [2018-12-31 03:59:04,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.27 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:04,516 INFO L168 Benchmark]: Boogie Preprocessor took 106.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:04,517 INFO L168 Benchmark]: RCFGBuilder took 722.05 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. [2018-12-31 03:59:04,518 INFO L168 Benchmark]: TraceAbstraction took 4716.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 846.4 MB in the end (delta: 258.6 MB). Peak memory consumption was 258.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:04,518 INFO L168 Benchmark]: Witness Printer took 105.10 ms. Allocated memory is still 1.2 GB. Free memory was 846.4 MB in the beginning and 839.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:59:04,526 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.99 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 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 65.27 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 722.05 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 4716.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 846.4 MB in the end (delta: 258.6 MB). Peak memory consumption was 258.6 MB. Max. memory is 11.5 GB. * Witness Printer took 105.10 ms. Allocated memory is still 1.2 GB. Free memory was 846.4 MB in the beginning and 839.7 MB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 72]: 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: 16]: Loop Invariant [2018-12-31 03:59:04,542 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,542 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,543 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,543 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 29]: Loop Invariant [2018-12-31 03:59:04,543 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,543 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,553 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,553 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 26]: Loop Invariant [2018-12-31 03:59:04,554 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,554 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,554 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,554 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,554 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,554 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,555 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,555 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,556 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,556 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,556 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,556 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967295bv32) == 0bv32) || (~bvadd64(\result, 4294967292bv32) == 0bv32 && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967293bv32) == 0bv32)) || (x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) || (~bvadd64(\result, 4294967294bv32) == 0bv32 && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 29]: Loop Invariant [2018-12-31 03:59:04,560 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,561 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,561 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,561 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 26]: Loop Invariant [2018-12-31 03:59:04,562 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,565 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,569 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,569 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 53]: Loop Invariant [2018-12-31 03:59:04,570 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,570 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,570 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:59:04,570 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: \result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 28 locations, 1 error locations. SAFE Result, 4.6s OverallTime, 12 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 413 SDtfs, 132 SDslu, 682 SDs, 0 SdLazy, 219 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 187 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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, 12 MinimizatonAttempts, 68 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 21 NumberOfFragments, 133 HoareAnnotationTreeSize, 7 FomulaSimplifications, 931 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 169 ConstructedInterpolants, 0 QuantifiedInterpolants, 6401 SizeOfPredicates, 32 NumberOfNonLiveVariables, 666 ConjunctsInSsa, 56 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...