./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_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 78c6d2d68aa498895f40ed0a4a24644b21119801 .............................................................................................................................................................................................................................................................................................................. 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_0960b_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 78c6d2d68aa498895f40ed0a4a24644b21119801 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:57:04,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:57:04,363 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:57:04,381 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:57:04,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:57:04,382 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:57:04,384 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:57:04,394 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:57:04,396 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:57:04,397 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:57:04,398 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:57:04,399 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:57:04,400 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:57:04,401 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:57:04,402 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:57:04,403 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:57:04,405 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:57:04,407 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:57:04,409 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:57:04,411 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:57:04,412 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:57:04,414 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:57:04,416 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:57:04,417 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:57:04,417 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:57:04,418 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:57:04,419 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:57:04,420 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:57:04,421 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:57:04,422 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:57:04,422 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:57:04,424 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:57:04,424 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:57:04,424 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:57:04,425 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:57:04,427 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:57:04,427 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:57:04,443 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:57:04,443 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:57:04,444 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:57:04,444 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:57:04,445 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:57:04,445 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:57:04,446 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:57:04,446 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:57:04,446 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:57:04,446 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:57:04,446 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:57:04,446 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:57:04,447 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:57:04,447 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:57:04,448 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:57:04,448 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:57:04,449 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:57:04,449 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:57:04,449 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:57:04,449 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:57:04,449 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:57:04,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:57:04,451 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:57:04,451 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:57:04,451 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:57:04,451 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:57:04,451 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:57:04,452 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:57:04,452 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 -> 78c6d2d68aa498895f40ed0a4a24644b21119801 [2018-12-31 03:57:04,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:57:04,521 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:57:04,527 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:57:04,529 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:57:04,530 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:57:04,530 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c [2018-12-31 03:57:04,592 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920887c2e/15853ce3c2e645bd95c8b0a4d6524199/FLAG0d6a598bb [2018-12-31 03:57:05,124 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:57:05,125 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c [2018-12-31 03:57:05,135 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920887c2e/15853ce3c2e645bd95c8b0a4d6524199/FLAG0d6a598bb [2018-12-31 03:57:05,426 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/920887c2e/15853ce3c2e645bd95c8b0a4d6524199 [2018-12-31 03:57:05,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:57:05,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:57:05,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:57:05,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:57:05,438 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:57:05,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:57:05" (1/1) ... [2018-12-31 03:57:05,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19d1a459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05, skipping insertion in model container [2018-12-31 03:57:05,442 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:57:05" (1/1) ... [2018-12-31 03:57:05,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:57:05,482 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:57:05,759 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:57:05,765 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:57:05,823 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:57:05,850 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:57:05,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05 WrapperNode [2018-12-31 03:57:05,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:57:05,853 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:57:05,853 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:57:05,853 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:57:05,864 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05" (1/1) ... [2018-12-31 03:57:05,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05" (1/1) ... [2018-12-31 03:57:05,991 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:57:05,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:57:05,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:57:05,991 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:57:06,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05" (1/1) ... [2018-12-31 03:57:06,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05" (1/1) ... [2018-12-31 03:57:06,008 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05" (1/1) ... [2018-12-31 03:57:06,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05" (1/1) ... [2018-12-31 03:57:06,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05" (1/1) ... [2018-12-31 03:57:06,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05" (1/1) ... [2018-12-31 03:57:06,039 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05" (1/1) ... [2018-12-31 03:57:06,049 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:57:06,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:57:06,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:57:06,053 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:57:06,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:57:06,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:57:06,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 03:57:06,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 03:57:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:57:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:57:06,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:57:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:57:06,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:57:06,892 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:57:06,893 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-12-31 03:57:06,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:57:06 BoogieIcfgContainer [2018-12-31 03:57:06,894 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:57:06,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:57:06,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:57:06,901 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:57:06,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:57:05" (1/3) ... [2018-12-31 03:57:06,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8f090f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:57:06, skipping insertion in model container [2018-12-31 03:57:06,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:05" (2/3) ... [2018-12-31 03:57:06,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8f090f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:57:06, skipping insertion in model container [2018-12-31 03:57:06,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:57:06" (3/3) ... [2018-12-31 03:57:06,910 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0960b_true-unreach-call.c [2018-12-31 03:57:06,922 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:57:06,932 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:57:06,952 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:57:06,991 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:57:06,992 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:57:06,992 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:57:06,992 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:57:06,993 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:57:06,993 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:57:06,993 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:57:06,993 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:57:06,993 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:57:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-12-31 03:57:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:57:07,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:07,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:07,028 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:07,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:07,039 INFO L82 PathProgramCache]: Analyzing trace with hash -306140874, now seen corresponding path program 1 times [2018-12-31 03:57:07,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:57:07,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:57:07,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:57:07,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:57:07,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:57:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:57:07,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:07,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:57:07,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:57:07,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:57:07,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:57:07,240 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-12-31 03:57:07,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:57:07,266 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2018-12-31 03:57:07,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:57:07,268 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-12-31 03:57:07,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:57:07,282 INFO L225 Difference]: With dead ends: 88 [2018-12-31 03:57:07,282 INFO L226 Difference]: Without dead ends: 42 [2018-12-31 03:57:07,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:57:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-31 03:57:07,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-31 03:57:07,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-31 03:57:07,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2018-12-31 03:57:07,332 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 12 [2018-12-31 03:57:07,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:57:07,333 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2018-12-31 03:57:07,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:57:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2018-12-31 03:57:07,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:57:07,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:07,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:07,335 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:07,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:07,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1933005595, now seen corresponding path program 1 times [2018-12-31 03:57:07,335 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:57:07,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:57:07,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:57:07,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:57:07,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:57:07,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:57:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:57:07,658 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:57:07,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:57:07 BoogieIcfgContainer [2018-12-31 03:57:07,712 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:57:07,713 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:57:07,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:57:07,713 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:57:07,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:57:06" (3/4) ... [2018-12-31 03:57:07,724 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:57:07,724 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:57:07,727 INFO L168 Benchmark]: Toolchain (without parser) took 2295.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -109.0 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:57:07,729 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:57:07,730 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.69 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 927.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:57:07,731 INFO L168 Benchmark]: Boogie Procedure Inliner took 138.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:57:07,732 INFO L168 Benchmark]: Boogie Preprocessor took 61.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:57:07,733 INFO L168 Benchmark]: RCFGBuilder took 841.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:57:07,734 INFO L168 Benchmark]: TraceAbstraction took 815.65 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: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:57:07,734 INFO L168 Benchmark]: Witness Printer took 11.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:57:07,740 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 418.69 ms. Allocated memory is still 1.0 GB. Free memory was 943.3 MB in the beginning and 927.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 138.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 927.2 MB in the beginning and 1.1 GB in the end (delta: -190.1 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 61.44 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 841.11 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.4 MB). Peak memory consumption was 31.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 815.65 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: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. * Witness Printer took 11.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 186]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 27, overapproximation of someUnaryDOUBLEoperation at line 181, overapproximation of someBinaryArithmeticDOUBLEoperation at line 148, overapproximation of bitwiseAnd at line 26. Possible FailurePath: [L32-L41] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L43] static const double zero = 0.0; [L126-L129] static const double two54_log10 = 1.80143985094819840000e+16, ivln10_log10 = 4.34294481903251816668e-01, log10_2hi_log10 = 3.01029995663611771306e-01, log10_2lo_log10 = 3.69423907715893078616e-13; [L131] static const double zero_log10 = 0.0; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L181] double x = -0.0; [L134] double y, z; [L135] __int32_t i, k, hx; [L136] __uint32_t lx; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L139] ieee_double_shape_type ew_u; [L140] ew_u.value = (x) [L141] EXPR ew_u.parts.msw [L141] (hx) = ew_u.parts.msw [L142] EXPR ew_u.parts.lsw [L142] (lx) = ew_u.parts.lsw [L145] k = 0 VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L146] COND TRUE hx < 0x00100000 VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L147] COND TRUE ((hx & 0x7fffffff) | lx) == 0 [L148] return -two54_log10 / zero_log10; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L182] double res = __ieee754_log10(x); [L19] __int32_t hx, lx; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (hx) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lx) = ew_u.parts.lsw [L26] hx &= 0x7fffffff [L27] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L28] hx = 0x7ff00000 - hx [L29] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L185] COND TRUE !isinf_double(res) [L186] __VERIFIER_error() VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:57:10,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:57:10,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:57:10,252 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:57:10,253 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:57:10,255 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:57:10,257 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:57:10,260 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:57:10,264 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:57:10,265 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:57:10,267 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:57:10,267 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:57:10,268 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:57:10,269 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:57:10,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:57:10,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:57:10,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:57:10,275 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:57:10,277 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:57:10,279 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:57:10,280 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:57:10,282 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:57:10,285 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:57:10,285 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:57:10,285 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:57:10,286 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:57:10,287 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:57:10,288 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:57:10,289 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:57:10,290 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:57:10,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:57:10,292 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:57:10,292 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:57:10,292 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:57:10,293 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:57:10,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:57:10,295 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:57:10,319 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:57:10,319 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:57:10,321 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:57:10,321 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:57:10,322 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:57:10,323 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:57:10,323 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:57:10,323 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:57:10,323 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:57:10,323 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:57:10,324 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:57:10,324 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:57:10,324 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:57:10,324 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:57:10,324 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:57:10,326 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:57:10,326 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:57:10,326 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:57:10,326 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:57:10,327 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:57:10,327 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:57:10,327 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:57:10,327 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:57:10,327 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:57:10,327 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:57:10,328 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:57:10,328 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:57:10,328 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:57:10,329 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:57:10,329 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:57:10,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 -> 78c6d2d68aa498895f40ed0a4a24644b21119801 [2018-12-31 03:57:10,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:57:10,419 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:57:10,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:57:10,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:57:10,428 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:57:10,429 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c [2018-12-31 03:57:10,506 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f923da1/4997a30c3392456b9b168e0ad1c879d8/FLAG902158bfb [2018-12-31 03:57:11,029 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:57:11,032 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c [2018-12-31 03:57:11,043 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f923da1/4997a30c3392456b9b168e0ad1c879d8/FLAG902158bfb [2018-12-31 03:57:11,348 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b1f923da1/4997a30c3392456b9b168e0ad1c879d8 [2018-12-31 03:57:11,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:57:11,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:57:11,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:57:11,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:57:11,359 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:57:11,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:57:11" (1/1) ... [2018-12-31 03:57:11,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22eac36e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11, skipping insertion in model container [2018-12-31 03:57:11,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:57:11" (1/1) ... [2018-12-31 03:57:11,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:57:11,408 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:57:11,737 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:57:11,749 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:57:11,823 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:57:11,859 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:57:11,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11 WrapperNode [2018-12-31 03:57:11,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:57:11,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:57:11,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:57:11,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:57:11,873 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11" (1/1) ... [2018-12-31 03:57:11,900 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11" (1/1) ... [2018-12-31 03:57:12,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:57:12,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:57:12,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:57:12,019 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:57:12,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11" (1/1) ... [2018-12-31 03:57:12,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11" (1/1) ... [2018-12-31 03:57:12,040 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11" (1/1) ... [2018-12-31 03:57:12,040 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11" (1/1) ... [2018-12-31 03:57:12,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11" (1/1) ... [2018-12-31 03:57:12,087 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11" (1/1) ... [2018-12-31 03:57:12,092 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11" (1/1) ... [2018-12-31 03:57:12,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:57:12,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:57:12,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:57:12,103 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:57:12,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:57:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-31 03:57:12,171 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:57:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:57:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:57:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:57:12,172 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:57:12,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 03:57:12,173 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:57:16,772 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:37,544 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:37,616 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:37,962 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:38,128 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:43,092 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:43,188 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:43,344 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:57:43,344 INFO L280 CfgBuilder]: Removed 24 assue(true) statements. [2018-12-31 03:57:43,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:57:43 BoogieIcfgContainer [2018-12-31 03:57:43,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:57:43,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:57:43,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:57:43,351 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:57:43,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:57:11" (1/3) ... [2018-12-31 03:57:43,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a4013d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:57:43, skipping insertion in model container [2018-12-31 03:57:43,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:57:11" (2/3) ... [2018-12-31 03:57:43,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79a4013d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:57:43, skipping insertion in model container [2018-12-31 03:57:43,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:57:43" (3/3) ... [2018-12-31 03:57:43,356 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0960b_true-unreach-call.c [2018-12-31 03:57:43,367 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:57:43,379 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:57:43,406 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:57:43,437 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:57:43,437 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:57:43,438 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:57:43,438 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:57:43,438 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:57:43,438 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:57:43,439 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:57:43,439 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:57:43,439 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:57:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-12-31 03:57:43,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:57:43,462 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:43,463 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:43,466 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:43,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:43,472 INFO L82 PathProgramCache]: Analyzing trace with hash -306140874, now seen corresponding path program 1 times [2018-12-31 03:57:43,476 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:43,477 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 [2018-12-31 03:57:43,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:57:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:44,457 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:57:44,472 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:44,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:44,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:57:44,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:57:44,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:57:44,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:57:44,527 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-12-31 03:57:44,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:57:44,551 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2018-12-31 03:57:44,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:57:44,552 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-12-31 03:57:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:57:44,564 INFO L225 Difference]: With dead ends: 88 [2018-12-31 03:57:44,565 INFO L226 Difference]: Without dead ends: 42 [2018-12-31 03:57:44,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:57:44,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-31 03:57:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-12-31 03:57:44,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-31 03:57:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2018-12-31 03:57:44,614 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 12 [2018-12-31 03:57:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:57:44,615 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2018-12-31 03:57:44,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:57:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2018-12-31 03:57:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:57:44,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:44,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:44,618 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:44,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:44,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1933005595, now seen corresponding path program 1 times [2018-12-31 03:57:44,619 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:44,619 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 [2018-12-31 03:57:44,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:57:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:45,751 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:46,065 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:57:46,072 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:57:46,073 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:57:46,075 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:57:46,083 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 [2018-12-31 03:57:46,329 WARN L181 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-12-31 03:57:46,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:57:46,404 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:57:46,420 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:57:46,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 85 [2018-12-31 03:57:46,722 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-12-31 03:57:46,737 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:57:46,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-12-31 03:57:46,749 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:57:46,850 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:57:46,888 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 17 treesize of output 13 [2018-12-31 03:57:46,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:57:46,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2018-12-31 03:57:46,912 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 03:57:46,918 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:57:46,946 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 32 treesize of output 24 [2018-12-31 03:57:46,955 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 24 treesize of output 10 [2018-12-31 03:57:46,956 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-31 03:57:46,980 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:57:46,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:57:47,128 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. [2018-12-31 03:57:47,128 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:88, output treesize:29 [2018-12-31 03:57:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:57:47,518 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:47,548 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:47,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:57:47,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-31 03:57:47,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-31 03:57:47,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:57:47,551 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand 8 states. [2018-12-31 03:57:55,606 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-31 03:57:57,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:57:57,913 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2018-12-31 03:57:58,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:57:58,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-12-31 03:57:58,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:57:58,076 INFO L225 Difference]: With dead ends: 58 [2018-12-31 03:57:58,076 INFO L226 Difference]: Without dead ends: 50 [2018-12-31 03:57:58,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-31 03:57:58,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-31 03:57:58,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-12-31 03:57:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-31 03:57:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2018-12-31 03:57:58,087 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 14 [2018-12-31 03:57:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:57:58,087 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2018-12-31 03:57:58,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-31 03:57:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2018-12-31 03:57:58,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:57:58,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:58,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:58,090 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:58,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:58,091 INFO L82 PathProgramCache]: Analyzing trace with hash 2124356858, now seen corresponding path program 1 times [2018-12-31 03:57:58,091 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:58,091 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:57:58,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:57:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:58,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:58,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:57:58,273 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:58,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:58,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:57:58,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:57:58,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:57:58,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:57:58,287 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 4 states. [2018-12-31 03:58:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:00,149 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-12-31 03:58:00,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:00,196 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 03:58:00,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:00,197 INFO L225 Difference]: With dead ends: 50 [2018-12-31 03:58:00,197 INFO L226 Difference]: Without dead ends: 16 [2018-12-31 03:58:00,198 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:00,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-12-31 03:58:00,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-12-31 03:58:00,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-12-31 03:58:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-12-31 03:58:00,202 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 14 [2018-12-31 03:58:00,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:00,202 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-12-31 03:58:00,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:00,203 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-12-31 03:58:00,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-31 03:58:00,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:00,203 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:00,204 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:00,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:00,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1233905145, now seen corresponding path program 1 times [2018-12-31 03:58:00,205 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:00,205 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:00,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:01,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:01,330 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:01,331 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:01,334 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:01,335 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:01,336 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 [2018-12-31 03:58:01,358 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:58:01,360 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 72 [2018-12-31 03:58:01,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:58:01,416 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 36 treesize of output 28 [2018-12-31 03:58:01,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:58:01,427 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:58:01,427 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:58:01,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-12-31 03:58:01,431 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-31 03:58:01,453 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:58:01,477 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 25 treesize of output 19 [2018-12-31 03:58:01,522 INFO L701 Elim1Store]: detected not equals via solver [2018-12-31 03:58:01,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2018-12-31 03:58:01,525 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-31 03:58:01,541 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:58:01,551 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:58:01,587 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. [2018-12-31 03:58:01,588 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:65, output treesize:28 [2018-12-31 03:58:01,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:01,620 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:01,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:01,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:01,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:01,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:01,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:01,646 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 4 states. [2018-12-31 03:58:01,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:01,705 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2018-12-31 03:58:01,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:01,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-31 03:58:01,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:01,706 INFO L225 Difference]: With dead ends: 16 [2018-12-31 03:58:01,707 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:58:01,707 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 [2018-12-31 03:58:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:58:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:58:01,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:58:01,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:58:01,709 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-12-31 03:58:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:01,710 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:58:01,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:01,710 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:58:01,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:58:01,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:58:01,979 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2018-12-31 03:58:01,979 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2018-12-31 03:58:01,980 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:58:01,980 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2018-12-31 03:58:01,980 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:58:01,980 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 188) no Hoare annotation was computed. [2018-12-31 03:58:01,980 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2018-12-31 03:58:01,980 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2018-12-31 03:58:01,980 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2018-12-31 03:58:01,982 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg .cse1) (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_log10_#res| .cse0) (= .cse1 ~two54_log10~0) (= ULTIMATE.start_isinf_double_~x .cse0) (= (_ +zero 11 53) ~zero_log10~0)))) [2018-12-31 03:58:01,983 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 20 25) no Hoare annotation was computed. [2018-12-31 03:58:01,983 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2018-12-31 03:58:01,983 INFO L444 ceAbstractionStarter]: At program point L29(lines 18 30) the Hoare annotation is: (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg .cse1) (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_log10_#res| .cse0) (= .cse1 ~two54_log10~0) (= ULTIMATE.start_isinf_double_~x .cse0) (exists ((|v_q#valueAsBitvector_8| (_ BitVec 64)) (v_prenex_17 (_ BitVec 64))) (let ((.cse2 ((_ extract 31 0) v_prenex_17))) (and (= .cse2 ((_ extract 31 0) |v_q#valueAsBitvector_8|)) (= (bvadd |ULTIMATE.start_isinf_double_#res| (_ bv4294967295 32)) (bvneg (bvlshr (let ((.cse3 (bvadd (bvneg (bvor (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_17)) (bvlshr (bvor .cse2 (bvneg .cse2)) (_ bv31 32)))) (_ bv2146435072 32)))) (bvor .cse3 (bvneg .cse3))) (_ bv31 32)))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17)))))) (= (_ +zero 11 53) ~zero_log10~0)))) [2018-12-31 03:58:01,984 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-31 03:58:01,984 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 153 157) no Hoare annotation was computed. [2018-12-31 03:58:01,984 INFO L444 ceAbstractionStarter]: At program point L153-2(lines 153 157) the Hoare annotation is: false [2018-12-31 03:58:01,984 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 158) no Hoare annotation was computed. [2018-12-31 03:58:01,984 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 133 173) no Hoare annotation was computed. [2018-12-31 03:58:01,984 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2018-12-31 03:58:01,984 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 138 143) no Hoare annotation was computed. [2018-12-31 03:58:01,985 INFO L444 ceAbstractionStarter]: At program point L138-2(lines 138 143) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_log10_~x (fp.neg (_ +zero 11 53))) (= ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0) ~two54_log10~0) (= (_ +zero 11 53) ~zero_log10~0)) [2018-12-31 03:58:01,985 INFO L448 ceAbstractionStarter]: For program point L138-3(lines 138 143) no Hoare annotation was computed. [2018-12-31 03:58:01,985 INFO L444 ceAbstractionStarter]: At program point L122(lines 45 124) the Hoare annotation is: false [2018-12-31 03:58:01,985 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 148) no Hoare annotation was computed. [2018-12-31 03:58:01,985 INFO L444 ceAbstractionStarter]: At program point L172(lines 133 173) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (and (= |ULTIMATE.start___ieee754_log10_#res| (fp.div roundNearestTiesToEven (fp.neg .cse0) (_ +zero 11 53))) (= .cse0 ~two54_log10~0) (= (_ +zero 11 53) ~zero_log10~0))) [2018-12-31 03:58:01,985 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2018-12-31 03:58:01,985 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:58:01,986 INFO L444 ceAbstractionStarter]: At program point L65-2(lines 65 69) the Hoare annotation is: false [2018-12-31 03:58:01,986 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 165 170) no Hoare annotation was computed. [2018-12-31 03:58:01,986 INFO L444 ceAbstractionStarter]: At program point L165-2(lines 165 170) the Hoare annotation is: false [2018-12-31 03:58:01,986 INFO L448 ceAbstractionStarter]: For program point L165-3(lines 165 170) no Hoare annotation was computed. [2018-12-31 03:58:01,986 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:58:01,986 INFO L451 ceAbstractionStarter]: At program point L190(lines 175 191) the Hoare annotation is: true [2018-12-31 03:58:01,986 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2018-12-31 03:58:01,987 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2018-12-31 03:58:01,987 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 150) no Hoare annotation was computed. [2018-12-31 03:58:01,987 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2018-12-31 03:58:01,987 INFO L444 ceAbstractionStarter]: At program point L50-2(lines 50 55) the Hoare annotation is: false [2018-12-31 03:58:01,987 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 50 55) no Hoare annotation was computed. [2018-12-31 03:58:01,987 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2018-12-31 03:58:01,987 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2018-12-31 03:58:01,987 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2018-12-31 03:58:01,988 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 81) the Hoare annotation is: false [2018-12-31 03:58:01,988 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 76 81) no Hoare annotation was computed. [2018-12-31 03:58:01,988 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 186) no Hoare annotation was computed. [2018-12-31 03:58:01,999 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,000 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,000 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,007 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,007 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,007 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,009 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,009 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,009 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,009 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,010 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,012 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,013 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,013 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,014 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,014 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,017 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,017 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,018 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,018 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,018 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-12-31 03:58:02,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,021 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,022 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,023 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,023 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,023 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,028 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,029 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,029 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,029 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,029 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-12-31 03:58:02,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,033 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,034 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,034 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,035 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,035 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,037 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:58:02 BoogieIcfgContainer [2018-12-31 03:58:02,040 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:58:02,040 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:58:02,040 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:58:02,041 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:58:02,041 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:57:43" (3/4) ... [2018-12-31 03:58:02,045 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:58:02,058 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-31 03:58:02,059 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-12-31 03:58:02,089 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && ~Pluszero~LONGDOUBLE() == zero_log10 [2018-12-31 03:58:02,089 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == zero_log10 [2018-12-31 03:58:02,090 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_8 : bv64, v_prenex_17 : bv64 :: (v_prenex_17[31:0] == v_q#valueAsBitvector_8[31:0] && ~bvadd64(\result, 4294967295bv32) == ~bvneg32(~bvlshr32(~bvor32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_prenex_17[63:32]), ~bvlshr32(~bvor32(v_prenex_17[31:0], ~bvneg32(v_prenex_17[31:0])), 31bv32))), 2146435072bv32), ~bvneg32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_prenex_17[63:32]), ~bvlshr32(~bvor32(v_prenex_17[31:0], ~bvneg32(v_prenex_17[31:0])), 31bv32))), 2146435072bv32))), 31bv32))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && ~Pluszero~LONGDOUBLE() == zero_log10 [2018-12-31 03:58:02,167 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:58:02,171 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:58:02,172 INFO L168 Benchmark]: Toolchain (without parser) took 50819.45 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 951.4 MB in the beginning and 874.6 MB in the end (delta: 76.8 MB). Peak memory consumption was 196.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:02,173 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:02,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 505.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:02,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 157.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:02,175 INFO L168 Benchmark]: Boogie Preprocessor took 80.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:02,175 INFO L168 Benchmark]: RCFGBuilder took 31244.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:02,176 INFO L168 Benchmark]: TraceAbstraction took 18694.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 888.1 MB in the end (delta: 172.2 MB). Peak memory consumption was 172.2 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:02,176 INFO L168 Benchmark]: Witness Printer took 130.68 ms. Allocated memory is still 1.1 GB. Free memory was 888.1 MB in the beginning and 874.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:02,181 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.18 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 505.71 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 157.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.91 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 31244.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 46.1 MB). Peak memory consumption was 46.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18694.24 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 888.1 MB in the end (delta: 172.2 MB). Peak memory consumption was 172.2 MB. Max. memory is 11.5 GB. * Witness Printer took 130.68 ms. Allocated memory is still 1.1 GB. Free memory was 888.1 MB in the beginning and 874.6 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,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_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,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_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 186]: 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: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 133]: Loop Invariant [2018-12-31 03:58:02,195 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,195 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,195 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,199 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,199 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,199 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant [2018-12-31 03:58:02,200 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,200 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,201 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,201 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,201 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,201 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,205 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,205 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,205 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,205 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 18]: Loop Invariant [2018-12-31 03:58:02,206 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,206 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,207 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,207 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,207 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,207 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-12-31 03:58:02,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,208 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,209 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,209 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,209 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,215 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,216 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,217 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,217 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2018-12-31 03:58:02,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,220 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,221 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,222 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,222 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2018-12-31 03:58:02,222 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] Derived loop invariant: (((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_8 : bv64, v_prenex_17 : bv64 :: (v_prenex_17[31:0] == v_q#valueAsBitvector_8[31:0] && ~bvadd64(\result, 4294967295bv32) == ~bvneg32(~bvlshr32(~bvor32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_prenex_17[63:32]), ~bvlshr32(~bvor32(v_prenex_17[31:0], ~bvneg32(v_prenex_17[31:0])), 31bv32))), 2146435072bv32), ~bvneg32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_prenex_17[63:32]), ~bvlshr32(~bvor32(v_prenex_17[31:0], ~bvneg32(v_prenex_17[31:0])), 31bv32))), 2146435072bv32))), 31bv32))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 138]: Loop Invariant [2018-12-31 03:58:02,226 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:02,227 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. SAFE Result, 18.5s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 12.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 123 SDtfs, 88 SDslu, 256 SDs, 0 SdLazy, 42 SolverSat, 4 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred 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, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 16 NumberOfFragments, 155 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 51 ConstructedInterpolants, 11 QuantifiedInterpolants, 6087 SizeOfPredicates, 18 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...