./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_1231b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_1231b_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 c714d208cb0b1f96f572e8a6108248eb76c73a94 ........................................................................................................................................................................................................................................................................................................................................................ 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_1231b_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 c714d208cb0b1f96f572e8a6108248eb76c73a94 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:08:50,251 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:08:50,253 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:08:50,265 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:08:50,266 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:08:50,267 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:08:50,268 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:08:50,270 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:08:50,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:08:50,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:08:50,274 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:08:50,274 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:08:50,276 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:08:50,277 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:08:50,278 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:08:50,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:08:50,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:08:50,282 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:08:50,285 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:08:50,286 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:08:50,288 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:08:50,289 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:08:50,292 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:08:50,293 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:08:50,293 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:08:50,294 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:08:50,296 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:08:50,296 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:08:50,298 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:08:50,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:08:50,299 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:08:50,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:08:50,301 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:08:50,301 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:08:50,302 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:08:50,303 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:08:50,304 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:08:50,319 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:08:50,320 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:08:50,321 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:08:50,321 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:08:50,321 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:08:50,322 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:08:50,322 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:08:50,322 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:08:50,322 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:08:50,322 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:08:50,322 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:08:50,324 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:08:50,324 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:08:50,324 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:08:50,324 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:08:50,325 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:08:50,325 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:08:50,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:08:50,326 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:08:50,326 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:08:50,326 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:08:50,326 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:08:50,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:08:50,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:08:50,327 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:08:50,327 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:08:50,327 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:08:50,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:08:50,329 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2019-01-12 09:08:50,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:08:50,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:08:50,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:08:50,411 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:08:50,412 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:08:50,413 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2019-01-12 09:08:50,473 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1acba2b/1e29ea5d0a4f4954a5237e797d6bfbd6/FLAG19a4a87b4 [2019-01-12 09:08:50,903 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:08:50,904 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2019-01-12 09:08:50,910 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1acba2b/1e29ea5d0a4f4954a5237e797d6bfbd6/FLAG19a4a87b4 [2019-01-12 09:08:51,270 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd1acba2b/1e29ea5d0a4f4954a5237e797d6bfbd6 [2019-01-12 09:08:51,274 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:08:51,277 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:08:51,278 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:08:51,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:08:51,284 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:08:51,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:08:51" (1/1) ... [2019-01-12 09:08:51,288 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e2c8cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51, skipping insertion in model container [2019-01-12 09:08:51,289 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:08:51" (1/1) ... [2019-01-12 09:08:51,298 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:08:51,318 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:08:51,585 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:08:51,591 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:08:51,630 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:08:51,661 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:08:51,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51 WrapperNode [2019-01-12 09:08:51,662 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:08:51,663 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:08:51,663 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:08:51,663 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:08:51,673 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51" (1/1) ... [2019-01-12 09:08:51,689 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51" (1/1) ... [2019-01-12 09:08:51,728 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:08:51,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:08:51,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:08:51,729 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:08:51,805 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51" (1/1) ... [2019-01-12 09:08:51,805 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51" (1/1) ... [2019-01-12 09:08:51,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51" (1/1) ... [2019-01-12 09:08:51,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51" (1/1) ... [2019-01-12 09:08:51,817 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51" (1/1) ... [2019-01-12 09:08:51,825 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51" (1/1) ... [2019-01-12 09:08:51,828 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51" (1/1) ... [2019-01-12 09:08:51,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:08:51,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:08:51,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:08:51,842 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:08:51,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:08:51,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:08:51,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:08:51,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:08:51,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:08:51,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:08:51,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:08:52,525 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:08:52,525 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-12 09:08:52,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:52 BoogieIcfgContainer [2019-01-12 09:08:52,527 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:08:52,528 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:08:52,528 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:08:52,531 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:08:52,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:08:51" (1/3) ... [2019-01-12 09:08:52,532 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24eaebaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:08:52, skipping insertion in model container [2019-01-12 09:08:52,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:51" (2/3) ... [2019-01-12 09:08:52,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24eaebaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:08:52, skipping insertion in model container [2019-01-12 09:08:52,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:52" (3/3) ... [2019-01-12 09:08:52,535 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b_true-unreach-call.c [2019-01-12 09:08:52,545 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:08:52,553 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:08:52,571 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:08:52,603 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:08:52,604 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:08:52,604 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:08:52,604 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:08:52,604 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:08:52,605 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:08:52,605 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:08:52,605 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:08:52,605 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:08:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-01-12 09:08:52,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:08:52,628 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:52,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:52,632 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:52,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:52,638 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-01-12 09:08:52,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:08:52,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:08:52,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:52,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:52,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:52,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:52,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:08:52,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:08:52,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:08:52,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:08:52,825 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-01-12 09:08:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:52,849 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-01-12 09:08:52,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:08:52,852 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-01-12 09:08:52,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:52,865 INFO L225 Difference]: With dead ends: 56 [2019-01-12 09:08:52,865 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:08:52,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:08:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:08:52,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:08:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:08:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-01-12 09:08:52,914 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-01-12 09:08:52,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:52,914 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-01-12 09:08:52,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:08:52,916 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-01-12 09:08:52,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:08:52,916 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:52,916 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:52,917 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:52,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:52,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-01-12 09:08:52,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:08:52,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:08:52,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:52,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:52,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:53,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:53,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:53,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:53,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:53,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:53,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:53,081 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2019-01-12 09:08:53,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:53,283 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-01-12 09:08:53,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:53,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-12 09:08:53,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:53,286 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:08:53,286 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:08:53,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:08:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:08:53,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-12 09:08:53,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:08:53,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:08:53,294 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-01-12 09:08:53,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:53,294 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:08:53,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:53,294 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:08:53,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:08:53,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:53,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:53,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:53,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:53,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2019-01-12 09:08:53,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:08:53,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:08:53,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:53,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:53,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:53,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:53,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:53,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:53,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:53,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:53,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:53,401 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-01-12 09:08:53,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:53,602 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-01-12 09:08:53,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:53,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-12 09:08:53,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:53,605 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:08:53,605 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:08:53,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:08:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:08:53,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-01-12 09:08:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:08:53,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:08:53,612 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2019-01-12 09:08:53,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:53,614 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:08:53,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:53,614 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:08:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:08:53,615 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:53,615 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:53,616 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-01-12 09:08:53,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:08:53,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:08:53,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:53,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:53,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:08:53,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:08:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:08:53,694 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:08:53,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:08:53 BoogieIcfgContainer [2019-01-12 09:08:53,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:08:53,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:08:53,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:08:53,728 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:08:53,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:52" (3/4) ... [2019-01-12 09:08:53,732 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:08:53,732 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:08:53,733 INFO L168 Benchmark]: Toolchain (without parser) took 2457.95 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 951.4 MB in the beginning and 988.6 MB in the end (delta: -37.2 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:53,735 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:08:53,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.65 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. [2019-01-12 09:08:53,736 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.11 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. [2019-01-12 09:08:53,738 INFO L168 Benchmark]: Boogie Preprocessor took 113.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -123.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:53,738 INFO L168 Benchmark]: RCFGBuilder took 684.83 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:53,739 INFO L168 Benchmark]: TraceAbstraction took 1199.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.6 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:53,740 INFO L168 Benchmark]: Witness Printer took 4.46 ms. Allocated memory is still 1.1 GB. Free memory is still 988.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:08:53,745 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.21 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 384.65 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.11 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 113.37 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 70.8 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -123.2 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 684.83 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: 21.2 MB). Peak memory consumption was 21.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1199.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.6 MB in the end (delta: 48.7 MB). Peak memory consumption was 48.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.46 ms. Allocated memory is still 1.1 GB. Free memory is still 988.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 68]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L60] double x = __VERIFIER_nondet_double(); [L61] double y = 0.0 / 0.0; [L16] return x != x; [L62] COND TRUE !isnan_double(x) [L18] __uint32_t msw, lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; [L64] double res = fmin_double(x, y); [L67] COND TRUE res != x [L68] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. UNSAFE Result, 1.1s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 121 SDtfs, 20 SDslu, 118 SDs, 0 SdLazy, 38 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred 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, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:08:56,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:08:56,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:08:56,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:08:56,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:08:56,033 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:08:56,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:08:56,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:08:56,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:08:56,042 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:08:56,043 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:08:56,050 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:08:56,051 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:08:56,053 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:08:56,054 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:08:56,055 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:08:56,058 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:08:56,059 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:08:56,064 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:08:56,069 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:08:56,071 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:08:56,074 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:08:56,077 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:08:56,078 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:08:56,078 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:08:56,079 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:08:56,080 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:08:56,083 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:08:56,084 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:08:56,087 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:08:56,088 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:08:56,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:08:56,089 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:08:56,089 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:08:56,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:08:56,092 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:08:56,092 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:08:56,117 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:08:56,120 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:08:56,121 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:08:56,121 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:08:56,122 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:08:56,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:08:56,122 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:08:56,122 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:08:56,122 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:08:56,122 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:08:56,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:08:56,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:08:56,123 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:08:56,124 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:08:56,124 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:08:56,124 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:08:56,124 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:08:56,124 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:08:56,124 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:08:56,126 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:08:56,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:08:56,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:08:56,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:08:56,126 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:08:56,127 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:08:56,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:08:56,127 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:08:56,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:08:56,127 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:08:56,127 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:08:56,128 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2019-01-12 09:08:56,177 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:08:56,197 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:08:56,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:08:56,206 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:08:56,206 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:08:56,207 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2019-01-12 09:08:56,271 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501e85c97/a6f150b99e9f46999e6e5f5f419043c2/FLAG5e613891c [2019-01-12 09:08:56,723 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:08:56,724 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1231b_true-unreach-call.c [2019-01-12 09:08:56,733 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501e85c97/a6f150b99e9f46999e6e5f5f419043c2/FLAG5e613891c [2019-01-12 09:08:57,058 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/501e85c97/a6f150b99e9f46999e6e5f5f419043c2 [2019-01-12 09:08:57,062 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:08:57,064 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:08:57,065 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:08:57,065 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:08:57,069 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:08:57,072 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:08:57" (1/1) ... [2019-01-12 09:08:57,075 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f9c43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57, skipping insertion in model container [2019-01-12 09:08:57,075 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:08:57" (1/1) ... [2019-01-12 09:08:57,083 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:08:57,107 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:08:57,365 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:08:57,376 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:08:57,423 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:08:57,460 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:08:57,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57 WrapperNode [2019-01-12 09:08:57,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:08:57,462 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:08:57,462 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:08:57,462 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:08:57,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57" (1/1) ... [2019-01-12 09:08:57,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57" (1/1) ... [2019-01-12 09:08:57,508 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:08:57,509 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:08:57,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:08:57,509 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:08:57,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57" (1/1) ... [2019-01-12 09:08:57,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57" (1/1) ... [2019-01-12 09:08:57,528 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57" (1/1) ... [2019-01-12 09:08:57,529 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57" (1/1) ... [2019-01-12 09:08:57,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57" (1/1) ... [2019-01-12 09:08:57,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57" (1/1) ... [2019-01-12 09:08:57,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57" (1/1) ... [2019-01-12 09:08:57,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:08:57,631 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:08:57,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:08:57,631 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:08:57,632 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:08:57,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:08:57,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:08:57,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:08:57,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:08:57,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:08:57,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:08:58,070 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:08:58,321 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:08:58,344 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:08:58,344 INFO L286 CfgBuilder]: Removed 16 assue(true) statements. [2019-01-12 09:08:58,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:58 BoogieIcfgContainer [2019-01-12 09:08:58,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:08:58,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:08:58,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:08:58,351 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:08:58,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:08:57" (1/3) ... [2019-01-12 09:08:58,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dc24f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:08:58, skipping insertion in model container [2019-01-12 09:08:58,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:08:57" (2/3) ... [2019-01-12 09:08:58,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58dc24f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:08:58, skipping insertion in model container [2019-01-12 09:08:58,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:58" (3/3) ... [2019-01-12 09:08:58,354 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b_true-unreach-call.c [2019-01-12 09:08:58,365 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:08:58,372 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:08:58,390 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:08:58,422 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:08:58,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:08:58,423 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:08:58,423 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:08:58,423 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:08:58,423 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:08:58,424 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:08:58,424 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:08:58,424 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:08:58,439 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-01-12 09:08:58,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-01-12 09:08:58,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:58,447 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:58,450 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:58,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:58,456 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-01-12 09:08:58,459 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:58,460 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:58,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:58,534 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:58,545 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:58,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:58,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:08:58,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:08:58,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:08:58,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:08:58,576 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-01-12 09:08:58,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:58,593 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-01-12 09:08:58,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:08:58,595 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-01-12 09:08:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:58,604 INFO L225 Difference]: With dead ends: 56 [2019-01-12 09:08:58,604 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:08:58,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:08:58,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:08:58,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:08:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:08:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-01-12 09:08:58,640 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-01-12 09:08:58,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:58,641 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-01-12 09:08:58,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:08:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-01-12 09:08:58,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:08:58,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:58,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:58,642 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:58,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-01-12 09:08:58,643 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:58,643 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:58,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:58,716 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:58,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:58,823 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:58,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:58,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:58,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:58,840 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2019-01-12 09:08:59,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:59,484 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-01-12 09:08:59,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:59,485 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-01-12 09:08:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:59,487 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:08:59,487 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:08:59,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:08:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:08:59,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-12 09:08:59,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:08:59,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:08:59,495 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-01-12 09:08:59,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:59,496 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:08:59,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:59,496 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:08:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-12 09:08:59,497 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:59,497 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:59,497 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:59,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:59,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1913129681, now seen corresponding path program 1 times [2019-01-12 09:08:59,498 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:59,499 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:59,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:59,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:59,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:59,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:59,628 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:59,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:59,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:59,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:59,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:59,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:59,642 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-01-12 09:08:59,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:59,888 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-01-12 09:08:59,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:59,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-01-12 09:08:59,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:59,891 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:08:59,891 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:08:59,892 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 [2019-01-12 09:08:59,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:08:59,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-01-12 09:08:59,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:08:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:08:59,899 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2019-01-12 09:08:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:59,900 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:08:59,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:08:59,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:08:59,902 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:59,902 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:59,903 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:59,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:59,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1959363189, now seen corresponding path program 1 times [2019-01-12 09:08:59,904 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:59,904 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:59,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:59,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:59,990 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:00,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:00,020 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:00,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:00,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:00,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:00,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:00,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:00,033 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-01-12 09:09:02,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:02,954 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-01-12 09:09:02,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:02,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 09:09:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:02,957 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:09:02,957 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:09:02,958 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 [2019-01-12 09:09:02,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:09:02,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-01-12 09:09:02,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:09:02,964 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2019-01-12 09:09:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:02,964 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:09:02,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:02,964 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:09:02,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:09:02,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:02,965 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:02,966 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:02,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:02,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2019-01-12 09:09:02,966 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:02,967 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:02,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:03,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:03,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:03,051 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:03,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:03,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:03,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:03,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:03,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:03,063 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-01-12 09:09:03,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:03,239 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-01-12 09:09:03,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:03,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-12 09:09:03,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:03,240 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:09:03,240 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:09:03,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:03,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:09:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-01-12 09:09:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-01-12 09:09:03,247 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2019-01-12 09:09:03,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:03,247 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-01-12 09:09:03,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-01-12 09:09:03,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:09:03,248 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:03,248 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:03,249 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:03,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:03,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-01-12 09:09:03,250 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:03,250 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:03,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:03,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:03,327 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:03,713 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:03,723 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:03,736 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:03,749 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:03,759 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 98 [2019-01-12 09:09:04,046 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 30 [2019-01-12 09:09:04,072 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:04,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 59 [2019-01-12 09:09:04,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:09:04,129 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-12 09:09:04,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2019-01-12 09:09:04,172 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:09:04,203 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:09:04,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 29 [2019-01-12 09:09:04,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 14 [2019-01-12 09:09:04,261 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:09:04,276 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:09:04,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:09:04,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:09:04,325 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:88, output treesize:34 [2019-01-12 09:09:06,341 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 64)) (v_prenex_9 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_q#valueAsBitvector_3|)) (.cse2 ((_ extract 63 32) |v_q#valueAsBitvector_3|))) (and (let ((.cse0 (fp ((_ extract 63 63) v_prenex_9) ((_ extract 62 52) v_prenex_9) ((_ extract 51 0) v_prenex_9)))) (fp.eq .cse0 .cse0)) (= c_ULTIMATE.start___fpclassify_double_~lsw~0 .cse1) (= ((_ extract 31 0) v_prenex_9) .cse1) (= ((_ extract 63 32) v_prenex_9) .cse2) (= c_ULTIMATE.start___fpclassify_double_~msw~0 .cse2)))) is different from true [2019-01-12 09:09:17,084 WARN L181 SmtUtils]: Spent 10.62 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-01-12 09:09:21,339 WARN L181 SmtUtils]: Spent 4.18 s on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-01-12 09:09:21,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:21,359 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:21,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:21,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:09:21,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:09:21,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:09:21,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2019-01-12 09:09:21,371 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 8 states. [2019-01-12 09:09:25,911 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 34 [2019-01-12 09:09:32,121 WARN L181 SmtUtils]: Spent 6.17 s on a formula simplification that was a NOOP. DAG size: 50 [2019-01-12 09:09:32,443 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-01-12 09:09:40,737 WARN L181 SmtUtils]: Spent 6.15 s on a formula simplification that was a NOOP. DAG size: 48 [2019-01-12 09:09:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:45,041 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2019-01-12 09:09:45,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 09:09:45,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-01-12 09:09:45,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:45,043 INFO L225 Difference]: With dead ends: 62 [2019-01-12 09:09:45,043 INFO L226 Difference]: Without dead ends: 46 [2019-01-12 09:09:45,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 34.2s TimeCoverageRelationStatistics Valid=56, Invalid=128, Unknown=2, NotChecked=24, Total=210 [2019-01-12 09:09:45,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-12 09:09:45,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2019-01-12 09:09:45,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:09:45,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-01-12 09:09:45,054 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2019-01-12 09:09:45,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:45,054 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-01-12 09:09:45,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:09:45,054 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-01-12 09:09:45,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-12 09:09:45,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:45,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:45,055 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:45,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:45,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2019-01-12 09:09:45,056 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:45,056 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:45,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:45,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:45,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:45,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:45,159 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:45,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:45,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:45,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:45,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:45,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:45,176 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 4 states. [2019-01-12 09:09:45,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:45,324 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2019-01-12 09:09:45,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:45,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-01-12 09:09:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:45,327 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:09:45,327 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:09:45,327 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 [2019-01-12 09:09:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:09:45,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-12 09:09:45,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-12 09:09:45,337 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2019-01-12 09:09:45,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:45,337 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-12 09:09:45,337 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:45,337 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-01-12 09:09:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:09:45,338 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:45,338 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:45,338 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:45,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash -666515868, now seen corresponding path program 1 times [2019-01-12 09:09:45,339 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:45,339 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:45,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:45,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:45,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:45,448 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:45,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:45,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:45,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:45,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:45,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:45,462 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2019-01-12 09:09:45,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:45,589 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-01-12 09:09:45,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:45,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-01-12 09:09:45,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:45,590 INFO L225 Difference]: With dead ends: 42 [2019-01-12 09:09:45,590 INFO L226 Difference]: Without dead ends: 38 [2019-01-12 09:09:45,591 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 [2019-01-12 09:09:45,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-12 09:09:45,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-01-12 09:09:45,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:45,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-01-12 09:09:45,601 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2019-01-12 09:09:45,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:45,601 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-01-12 09:09:45,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:45,602 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-01-12 09:09:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:09:45,602 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:45,602 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:45,603 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:45,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:45,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2019-01-12 09:09:45,604 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:45,604 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) [2019-01-12 09:09:45,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:45,691 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:45,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:45,718 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:45,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:45,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:45,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:45,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:45,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:45,731 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2019-01-12 09:09:45,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:45,782 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-01-12 09:09:45,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:45,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-01-12 09:09:45,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:45,784 INFO L225 Difference]: With dead ends: 33 [2019-01-12 09:09:45,784 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 09:09:45,785 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 [2019-01-12 09:09:45,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 09:09:45,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-01-12 09:09:45,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-01-12 09:09:45,796 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2019-01-12 09:09:45,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:45,796 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-01-12 09:09:45,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:45,797 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-01-12 09:09:45,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-12 09:09:45,797 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:45,797 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:45,798 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:45,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:45,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2019-01-12 09:09:45,798 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:45,799 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 [2019-01-12 09:09:45,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:45,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:45,989 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:46,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:46,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:09:46,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:09:46,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:09:46,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:09:46,004 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-01-12 09:09:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:48,375 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-01-12 09:09:48,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:09:48,376 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-01-12 09:09:48,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:48,377 INFO L225 Difference]: With dead ends: 38 [2019-01-12 09:09:48,377 INFO L226 Difference]: Without dead ends: 28 [2019-01-12 09:09:48,377 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:09:48,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-12 09:09:48,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-12 09:09:48,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:09:48,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2019-01-12 09:09:48,385 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2019-01-12 09:09:48,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:48,385 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2019-01-12 09:09:48,385 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:09:48,385 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2019-01-12 09:09:48,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:09:48,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:48,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:48,386 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:48,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:48,387 INFO L82 PathProgramCache]: Analyzing trace with hash 782688991, now seen corresponding path program 1 times [2019-01-12 09:09:48,387 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:48,387 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 [2019-01-12 09:09:48,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:48,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:48,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:48,483 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:48,495 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:48,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:48,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:48,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:48,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:48,497 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 4 states. [2019-01-12 09:09:48,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:48,607 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-01-12 09:09:48,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:48,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-01-12 09:09:48,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:48,609 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:09:48,609 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:09:48,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:48,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:09:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-01-12 09:09:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-12 09:09:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-01-12 09:09:48,619 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2019-01-12 09:09:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:48,620 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-01-12 09:09:48,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-01-12 09:09:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-12 09:09:48,621 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:48,621 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:48,621 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:48,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:48,621 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2019-01-12 09:09:48,622 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:48,622 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) [2019-01-12 09:09:48,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:48,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:49,286 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-12 09:09:49,596 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-12 09:09:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:49,612 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:49,623 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:49,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:09:49,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:09:49,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:09:49,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:09:49,624 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2019-01-12 09:09:50,322 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-01-12 09:09:50,991 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-01-12 09:09:51,470 WARN L181 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2019-01-12 09:09:51,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:51,593 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2019-01-12 09:09:51,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:09:51,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-01-12 09:09:51,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:51,595 INFO L225 Difference]: With dead ends: 50 [2019-01-12 09:09:51,595 INFO L226 Difference]: Without dead ends: 46 [2019-01-12 09:09:51,596 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:09:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-01-12 09:09:51,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2019-01-12 09:09:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-12 09:09:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-01-12 09:09:51,610 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2019-01-12 09:09:51,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:51,611 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-01-12 09:09:51,611 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:09:51,611 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-01-12 09:09:51,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-01-12 09:09:51,612 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:51,612 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:51,612 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:51,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:51,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1085928516, now seen corresponding path program 1 times [2019-01-12 09:09:51,613 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:51,613 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:51,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:51,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:51,885 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:51,896 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:51,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:09:51,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:09:51,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:09:51,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:09:51,898 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 7 states. [2019-01-12 09:09:52,309 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2019-01-12 09:09:52,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:52,432 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-01-12 09:09:52,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:09:52,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-01-12 09:09:52,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:52,434 INFO L225 Difference]: With dead ends: 40 [2019-01-12 09:09:52,434 INFO L226 Difference]: Without dead ends: 36 [2019-01-12 09:09:52,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:09:52,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-12 09:09:52,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2019-01-12 09:09:52,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:09:52,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-01-12 09:09:52,445 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2019-01-12 09:09:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:52,445 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-01-12 09:09:52,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:09:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-01-12 09:09:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:09:52,446 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:52,446 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:52,446 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:52,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:52,447 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2019-01-12 09:09:52,447 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:52,447 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 09:09:52,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:52,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:52,564 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:52,615 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:52,620 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:52,622 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:52,624 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:09:52,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 76 [2019-01-12 09:09:52,791 INFO L303 Elim1Store]: Index analysis took 161 ms [2019-01-12 09:09:52,792 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2019-01-12 09:09:52,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:09:52,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2019-01-12 09:09:52,972 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:09:53,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2019-01-12 09:09:53,115 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2019-01-12 09:09:53,115 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:09:53,128 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:09:53,137 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:09:53,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:09:53,172 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:67, output treesize:31 [2019-01-12 09:09:53,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:53,216 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:53,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:53,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 09:09:53,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 09:09:53,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 09:09:53,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 09:09:53,229 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2019-01-12 09:09:53,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:53,654 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-01-12 09:09:53,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 09:09:53,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-01-12 09:09:53,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:53,657 INFO L225 Difference]: With dead ends: 34 [2019-01-12 09:09:53,657 INFO L226 Difference]: Without dead ends: 26 [2019-01-12 09:09:53,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 09:09:53,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-01-12 09:09:53,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-01-12 09:09:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-12 09:09:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-12 09:09:53,668 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2019-01-12 09:09:53,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:53,668 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-12 09:09:53,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 09:09:53,668 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-12 09:09:53,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:09:53,669 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:09:53,669 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:09:53,669 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:09:53,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:09:53,670 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2019-01-12 09:09:53,670 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:09:53,670 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-01-12 09:09:53,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:09:53,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:09:53,787 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:09:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:09:53,919 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:09:53,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:09:53,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:09:53,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:09:53,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:09:53,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:09:53,941 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2019-01-12 09:09:54,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:09:54,122 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2019-01-12 09:09:54,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:09:54,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-01-12 09:09:54,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:09:54,123 INFO L225 Difference]: With dead ends: 26 [2019-01-12 09:09:54,123 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:09:54,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:09:54,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:09:54,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:09:54,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:09:54,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:09:54,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-01-12 09:09:54,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:09:54,128 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:09:54,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:09:54,128 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:09:54,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:09:54,132 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:09:54,279 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 115 [2019-01-12 09:09:54,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:09:54,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 09:09:55,307 WARN L181 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 29 [2019-01-12 09:09:55,501 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 17 [2019-01-12 09:09:55,708 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-01-12 09:09:55,913 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2019-01-12 09:10:03,126 WARN L181 SmtUtils]: Spent 7.21 s on a formula simplification. DAG size of input: 148 DAG size of output: 44 [2019-01-12 09:10:03,129 INFO L451 ceAbstractionStarter]: At program point L73(lines 53 74) the Hoare annotation is: true [2019-01-12 09:10:03,129 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:10:03,129 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:10:03,130 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:10:03,130 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-01-12 09:10:03,130 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2019-01-12 09:10:03,130 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmin_double_~x) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_main_~y~0 .cse0))) [2019-01-12 09:10:03,130 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 17 42) no Hoare annotation was computed. [2019-01-12 09:10:03,130 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (= (bvadd |ULTIMATE.start_isnan_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (not .cse0)) (and (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) .cse0))) (= ULTIMATE.start_main_~y~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) [2019-01-12 09:10:03,130 INFO L448 ceAbstractionStarter]: For program point L20-5(lines 20 25) no Hoare annotation was computed. [2019-01-12 09:10:03,131 INFO L444 ceAbstractionStarter]: At program point L20-6(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_main_~y~0 .cse0))) [2019-01-12 09:10:03,131 INFO L448 ceAbstractionStarter]: For program point L45(lines 45 46) no Hoare annotation was computed. [2019-01-12 09:10:03,131 INFO L448 ceAbstractionStarter]: For program point L20-7(lines 17 42) no Hoare annotation was computed. [2019-01-12 09:10:03,131 INFO L444 ceAbstractionStarter]: At program point L41(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (or (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967293 32)) (_ bv0 32))) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmin_double_~x) (exists ((v_prenex_14 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_14) ((_ extract 62 52) v_prenex_14) ((_ extract 51 0) v_prenex_14)) ULTIMATE.start_fmin_double_~x) (= ((_ extract 63 32) v_prenex_14) ULTIMATE.start___fpclassify_double_~msw~0))) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_main_~y~0 .cse0))) [2019-01-12 09:10:03,131 INFO L444 ceAbstractionStarter]: At program point L41-1(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= |ULTIMATE.start___fpclassify_double_#res| (_ bv0 32)) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64)) (v_prenex_16 (_ BitVec 64))) (let ((.cse2 ((_ extract 63 32) |v_q#valueAsBitvector_5|)) (.cse1 ((_ extract 31 0) v_prenex_16))) (and (= .cse1 ((_ extract 31 0) |v_q#valueAsBitvector_5|)) (= ((_ extract 63 32) v_prenex_16) .cse2) (= .cse2 ULTIMATE.start___fpclassify_double_~msw~0) (= .cse1 ULTIMATE.start___fpclassify_double_~lsw~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))))) (= ULTIMATE.start_main_~y~0 .cse0))) [2019-01-12 09:10:03,131 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-01-12 09:10:03,131 INFO L448 ceAbstractionStarter]: For program point L37-1(lines 37 41) no Hoare annotation was computed. [2019-01-12 09:10:03,131 INFO L448 ceAbstractionStarter]: For program point L33(lines 33 41) no Hoare annotation was computed. [2019-01-12 09:10:03,132 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:10:03,138 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 33 41) no Hoare annotation was computed. [2019-01-12 09:10:03,138 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 71) no Hoare annotation was computed. [2019-01-12 09:10:03,138 INFO L448 ceAbstractionStarter]: For program point L62-2(lines 62 71) no Hoare annotation was computed. [2019-01-12 09:10:03,138 INFO L448 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-01-12 09:10:03,138 INFO L448 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2019-01-12 09:10:03,138 INFO L444 ceAbstractionStarter]: At program point L50-3(lines 44 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_isnan_double_#res| (_ bv0 32)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~x~0 |ULTIMATE.start_fmin_double_#res|) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|)) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))) (= ULTIMATE.start_main_~y~0 .cse0))) [2019-01-12 09:10:03,139 INFO L448 ceAbstractionStarter]: For program point L67(lines 67 70) no Hoare annotation was computed. [2019-01-12 09:10:03,139 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-01-12 09:10:03,139 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 30 41) no Hoare annotation was computed. [2019-01-12 09:10:03,139 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 48) no Hoare annotation was computed. [2019-01-12 09:10:03,139 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-01-12 09:10:03,150 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,151 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,152 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,152 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,161 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,164 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,165 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,165 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,167 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,170 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,172 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,175 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,176 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,176 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,180 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,182 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,183 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,184 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,185 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,187 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,188 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,188 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,188 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,191 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,192 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,192 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,193 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,194 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,196 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,197 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,197 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,199 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,200 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,200 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,200 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,201 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,202 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,204 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,205 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,206 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,208 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,210 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,210 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:10:03 BoogieIcfgContainer [2019-01-12 09:10:03,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:10:03,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:10:03,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:10:03,216 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:10:03,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:08:58" (3/4) ... [2019-01-12 09:10:03,224 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:10:03,239 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-01-12 09:10:03,239 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-12 09:10:03,239 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:10:03,267 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) || (\result == 0bv32 && ~fp.eq~DOUBLE(x, x))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:03,267 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == 0bv32) && x == x) && x == x) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:03,268 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == 0bv32) && (((~bvadd64(\result, 4294967294bv32) == 0bv32 || ~bvadd64(\result, 4294967292bv32) == 0bv32) || ~bvadd64(\result, 4294967295bv32) == 0bv32) || ~bvadd64(\result, 4294967293bv32) == 0bv32)) && x == x) && x == x) && (\exists v_prenex_14 : bv64 :: ~fp~LONGDOUBLE(v_prenex_14[63:63], v_prenex_14[62:52], v_prenex_14[51:0]) == x && v_prenex_14[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:03,268 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == \result) && (\exists v_q#valueAsBitvector_4 : bv64 :: msw == v_q#valueAsBitvector_4[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:03,268 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:03,269 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && (\exists v_q#valueAsBitvector_5 : bv64, v_prenex_16 : bv64 :: (((v_prenex_16[31:0] == v_q#valueAsBitvector_5[31:0] && v_prenex_16[63:32] == v_q#valueAsBitvector_5[63:32]) && v_q#valueAsBitvector_5[63:32] == msw) && v_prenex_16[31:0] == lsw) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-01-12 09:10:03,329 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:10:03,332 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:10:03,333 INFO L168 Benchmark]: Toolchain (without parser) took 66270.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 197.7 MB). Free memory was 951.3 MB in the beginning and 853.7 MB in the end (delta: 97.6 MB). Peak memory consumption was 295.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:03,334 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:10:03,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.55 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:03,338 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.66 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:03,338 INFO L168 Benchmark]: Boogie Preprocessor took 121.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:03,339 INFO L168 Benchmark]: RCFGBuilder took 715.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.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:03,339 INFO L168 Benchmark]: TraceAbstraction took 64867.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 860.7 MB in the end (delta: 244.9 MB). Peak memory consumption was 305.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:03,339 INFO L168 Benchmark]: Witness Printer took 116.59 ms. Allocated memory is still 1.2 GB. Free memory was 860.7 MB in the beginning and 853.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:10:03,346 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.16 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 396.55 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 46.66 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 121.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -190.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 715.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.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64867.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 860.7 MB in the end (delta: 244.9 MB). Peak memory consumption was 305.2 MB. Max. memory is 11.5 GB. * Witness Printer took 116.59 ms. Allocated memory is still 1.2 GB. Free memory was 860.7 MB in the beginning and 853.7 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: 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: 44]: Loop Invariant [2019-01-12 09:10:03,364 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,364 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,366 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,366 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,368 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,368 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2019-01-12 09:10:03,369 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,369 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == \result) && (\exists v_q#valueAsBitvector_4 : bv64 :: msw == v_q#valueAsBitvector_4[63:32] && ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 16]: Loop Invariant [2019-01-12 09:10:03,370 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,378 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~bvadd64(\result, 4294967295bv32) == 0bv32 && !~fp.eq~DOUBLE(x, x)) || (\result == 0bv32 && ~fp.eq~DOUBLE(x, x))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 09:10:03,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,379 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == 0bv32) && x == x) && x == x) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 17]: Loop Invariant [2019-01-12 09:10:03,380 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,382 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,384 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,384 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,384 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,385 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_16,QUANTIFIED] [2019-01-12 09:10:03,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,391 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2019-01-12 09:10:03,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,392 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && (\exists v_q#valueAsBitvector_5 : bv64, v_prenex_16 : bv64 :: (((v_prenex_16[31:0] == v_q#valueAsBitvector_5[31:0] && v_prenex_16[63:32] == v_q#valueAsBitvector_5[63:32]) && v_q#valueAsBitvector_5[63:32] == msw) && v_prenex_16[31:0] == lsw) && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()))) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 09:10:03,396 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,397 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.eq~DOUBLE(x, x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && \result == 0bv32) && x == x) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant [2019-01-12 09:10:03,398 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,398 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,399 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,403 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,403 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,406 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:10:03,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,406 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,407 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_14,QUANTIFIED] [2019-01-12 09:10:03,407 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && \result == 0bv32) && (((~bvadd64(\result, 4294967294bv32) == 0bv32 || ~bvadd64(\result, 4294967292bv32) == 0bv32) || ~bvadd64(\result, 4294967295bv32) == 0bv32) || ~bvadd64(\result, 4294967293bv32) == 0bv32)) && x == x) && x == x) && (\exists v_prenex_14 : bv64 :: ~fp~LONGDOUBLE(v_prenex_14[63:63], v_prenex_14[62:52], v_prenex_14[51:0]) == x && v_prenex_14[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. SAFE Result, 64.7s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 33.6s AutomataDifference, 0.0s DeadEndRemovalTime, 8.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 487 SDtfs, 361 SDslu, 736 SDs, 0 SdLazy, 378 SolverSat, 18 SolverUnsat, 5 SolverUnknown, 0 SolverNotchecked, 14.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 273 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 37.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=12, 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.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 106 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 249 HoareAnnotationTreeSize, 7 FomulaSimplifications, 4793 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14630 FormulaSimplificationTreeSizeReductionInter, 8.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 20.3s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 243 ConstructedInterpolants, 26 QuantifiedInterpolants, 28888 SizeOfPredicates, 53 NumberOfNonLiveVariables, 915 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...