./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0930_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_0930_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 a2549d464b179f7f7f50962dd1fbb8e0dbdceb3b ............................................................................................................................................................................................................................................................................................. 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_0930_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 a2549d464b179f7f7f50962dd1fbb8e0dbdceb3b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:56:50,763 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:56:50,765 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:56:50,790 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:56:50,790 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:56:50,791 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:56:50,793 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:56:50,795 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:56:50,797 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:56:50,798 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:56:50,801 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:56:50,802 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:56:50,803 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:56:50,806 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:56:50,813 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:56:50,816 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:56:50,817 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:56:50,822 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:56:50,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:56:50,832 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:56:50,836 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:56:50,837 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:56:50,843 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:56:50,843 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:56:50,843 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:56:50,844 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:56:50,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:56:50,847 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:56:50,850 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:56:50,851 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:56:50,851 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:56:50,852 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:56:50,852 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:56:50,852 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:56:50,855 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:56:50,856 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:56:50,856 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:56:50,886 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:56:50,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:56:50,891 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:56:50,891 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:56:50,892 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:56:50,892 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:56:50,892 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:56:50,892 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:56:50,892 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:56:50,893 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:56:50,894 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:56:50,894 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:56:50,894 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:56:50,894 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:56:50,894 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:56:50,895 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:56:50,895 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:56:50,895 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:56:50,895 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:56:50,895 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:56:50,895 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:56:50,897 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:56:50,898 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:56:50,898 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:56:50,898 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:56:50,898 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:56:50,898 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:56:50,898 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:56:50,899 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 -> a2549d464b179f7f7f50962dd1fbb8e0dbdceb3b [2018-12-31 03:56:50,947 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:56:50,963 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:56:50,969 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:56:50,974 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:56:50,977 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:56:50,978 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0930_true-unreach-call.c [2018-12-31 03:56:51,044 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5e87125/84c85218bca145edb46f790bda88766f/FLAG52d84054a [2018-12-31 03:56:51,512 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:56:51,512 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0930_true-unreach-call.c [2018-12-31 03:56:51,519 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5e87125/84c85218bca145edb46f790bda88766f/FLAG52d84054a [2018-12-31 03:56:51,869 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f5e87125/84c85218bca145edb46f790bda88766f [2018-12-31 03:56:51,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:56:51,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:56:51,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:56:51,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:56:51,884 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:56:51,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:56:51" (1/1) ... [2018-12-31 03:56:51,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a5801be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:51, skipping insertion in model container [2018-12-31 03:56:51,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:56:51" (1/1) ... [2018-12-31 03:56:51,898 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:56:51,924 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:56:52,204 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:56:52,216 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:56:52,304 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:56:52,343 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:56:52,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:52 WrapperNode [2018-12-31 03:56:52,343 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:56:52,344 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:56:52,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:56:52,344 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:56:52,421 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:56:52" (1/1) ... [2018-12-31 03:56:52,438 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:56:52" (1/1) ... [2018-12-31 03:56:52,472 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:56:52,472 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:56:52,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:56:52,472 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:56:52,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:52" (1/1) ... [2018-12-31 03:56:52,484 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:52" (1/1) ... [2018-12-31 03:56:52,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:52" (1/1) ... [2018-12-31 03:56:52,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:52" (1/1) ... [2018-12-31 03:56:52,500 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:52" (1/1) ... [2018-12-31 03:56:52,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:52" (1/1) ... [2018-12-31 03:56:52,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:52" (1/1) ... [2018-12-31 03:56:52,512 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:56:52,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:56:52,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:56:52,513 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:56:52,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:56:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:56:52,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 03:56:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 03:56:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:56:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:56:52,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:56:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:56:52,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:56:53,203 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:56:53,204 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 03:56:53,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:56:53 BoogieIcfgContainer [2018-12-31 03:56:53,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:56:53,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:56:53,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:56:53,210 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:56:53,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:56:51" (1/3) ... [2018-12-31 03:56:53,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd0c827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:56:53, skipping insertion in model container [2018-12-31 03:56:53,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:52" (2/3) ... [2018-12-31 03:56:53,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fd0c827 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:56:53, skipping insertion in model container [2018-12-31 03:56:53,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:56:53" (3/3) ... [2018-12-31 03:56:53,215 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0930_true-unreach-call.c [2018-12-31 03:56:53,225 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:56:53,235 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:56:53,253 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:56:53,286 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:56:53,287 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:56:53,287 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:56:53,287 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:56:53,287 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:56:53,287 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:56:53,288 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:56:53,288 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:56:53,288 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:56:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-31 03:56:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:56:53,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:56:53,311 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:56:53,314 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:56:53,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:56:53,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1030213693, now seen corresponding path program 1 times [2018-12-31 03:56:53,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:56:53,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:56:53,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:56:53,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:56:53,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:56:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:56:53,451 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:56:53,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:56:53,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:56:53,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:56:53,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:56:53,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:56:53,478 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-12-31 03:56:53,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:56:53,499 INFO L93 Difference]: Finished difference Result 64 states and 104 transitions. [2018-12-31 03:56:53,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:56:53,501 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 03:56:53,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:56:53,512 INFO L225 Difference]: With dead ends: 64 [2018-12-31 03:56:53,512 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 03:56:53,515 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:56:53,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 03:56:53,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-31 03:56:53,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 03:56:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2018-12-31 03:56:53,550 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 10 [2018-12-31 03:56:53,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:56:53,550 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-12-31 03:56:53,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:56:53,551 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2018-12-31 03:56:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:56:53,551 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:56:53,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:56:53,552 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:56:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:56:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1305093504, now seen corresponding path program 1 times [2018-12-31 03:56:53,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:56:53,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:56:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:56:53,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:56:53,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:56:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:56:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:56:53,642 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:56:53,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:56:53 BoogieIcfgContainer [2018-12-31 03:56:53,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:56:53,688 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:56:53,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:56:53,688 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:56:53,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:56:53" (3/4) ... [2018-12-31 03:56:53,694 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:56:53,694 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:56:53,696 INFO L168 Benchmark]: Toolchain (without parser) took 1820.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -105.3 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:56:53,698 INFO L168 Benchmark]: CDTParser took 0.19 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:56:53,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.81 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 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:56:53,700 INFO L168 Benchmark]: Boogie Procedure Inliner took 127.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:56:53,701 INFO L168 Benchmark]: Boogie Preprocessor took 40.37 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:56:53,702 INFO L168 Benchmark]: RCFGBuilder took 691.80 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:56:53,703 INFO L168 Benchmark]: TraceAbstraction took 482.10 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:56:53,704 INFO L168 Benchmark]: Witness Printer took 6.72 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:56:53,712 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 463.81 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 936.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 127.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -173.5 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.37 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 691.80 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: 25.4 MB). Peak memory consumption was 25.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 482.10 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * Witness Printer took 6.72 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: 150]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of bitwiseOr at line 59, overapproximation of someBinaryArithmeticDOUBLEoperation at line 60. 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; VAL [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, two54_log=18014398509481984, zero=0] [L144] double x = 1.0; [L46] double hfsq, f, s, z, R, w, t1, t2, dk; [L47] __int32_t k, hx, i, j; [L48] __uint32_t lx; VAL [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, two54_log=18014398509481984, zero=0] [L51] ieee_double_shape_type ew_u; [L52] ew_u.value = (x) [L53] EXPR ew_u.parts.msw [L53] (hx) = ew_u.parts.msw [L54] EXPR ew_u.parts.lsw [L54] (lx) = ew_u.parts.lsw [L57] k = 0 VAL [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, two54_log=18014398509481984, zero=0] [L58] COND TRUE hx < 0x00100000 VAL [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, two54_log=18014398509481984, zero=0] [L59] COND TRUE ((hx & 0x7fffffff) | lx) == 0 [L60] return -two54_log / zero; VAL [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, two54_log=18014398509481984, zero=0] [L146] double res = __ieee754_log(x); [L149] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [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, two54_log=18014398509481984, zero=0] [L149] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L150] __VERIFIER_error() VAL [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, two54_log=18014398509481984, zero=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 44 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=33occurred 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.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 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:56:56,281 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:56:56,284 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:56:56,300 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:56:56,302 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:56:56,304 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:56:56,306 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:56:56,310 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:56:56,314 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:56:56,315 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:56:56,317 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:56:56,318 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:56:56,319 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:56:56,321 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:56:56,329 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:56:56,331 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:56:56,334 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:56:56,338 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:56:56,344 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:56:56,345 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:56:56,346 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:56:56,349 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:56:56,354 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:56:56,355 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:56:56,355 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:56:56,356 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:56:56,357 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:56:56,358 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:56:56,360 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:56:56,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:56:56,364 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:56:56,365 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:56:56,365 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:56:56,365 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:56:56,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:56:56,371 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:56:56,371 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:56:56,396 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:56:56,397 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:56:56,399 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:56:56,400 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:56:56,400 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:56:56,400 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:56:56,401 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:56:56,402 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:56:56,402 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:56:56,402 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:56:56,402 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:56:56,402 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:56:56,402 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:56:56,403 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:56:56,403 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:56:56,404 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:56:56,404 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:56:56,404 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:56:56,404 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:56:56,404 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:56:56,405 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:56:56,405 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:56:56,405 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:56:56,405 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:56:56,405 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:56:56,406 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:56:56,408 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:56:56,409 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:56:56,409 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:56:56,409 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:56:56,409 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 -> a2549d464b179f7f7f50962dd1fbb8e0dbdceb3b [2018-12-31 03:56:56,479 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:56:56,494 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:56:56,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:56:56,502 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:56:56,502 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:56:56,503 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0930_true-unreach-call.c [2018-12-31 03:56:56,558 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1bdb59d/469c6611cb0a44529cd8c4a6ee78c86b/FLAGb74c248cb [2018-12-31 03:56:57,077 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:56:57,078 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0930_true-unreach-call.c [2018-12-31 03:56:57,087 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1bdb59d/469c6611cb0a44529cd8c4a6ee78c86b/FLAGb74c248cb [2018-12-31 03:56:57,372 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1bdb59d/469c6611cb0a44529cd8c4a6ee78c86b [2018-12-31 03:56:57,377 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:56:57,379 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:56:57,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:56:57,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:56:57,385 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:56:57,387 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:56:57" (1/1) ... [2018-12-31 03:56:57,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a8e7523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:57, skipping insertion in model container [2018-12-31 03:56:57,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:56:57" (1/1) ... [2018-12-31 03:56:57,400 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:56:57,431 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:56:57,778 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:56:57,789 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:56:57,886 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:56:57,934 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:56:57,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:57 WrapperNode [2018-12-31 03:56:57,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:56:57,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:56:57,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:56:57,936 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:56:58,025 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:56:57" (1/1) ... [2018-12-31 03:56:58,046 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:56:57" (1/1) ... [2018-12-31 03:56:58,100 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:56:58,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:56:58,104 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:56:58,104 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:56:58,116 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:57" (1/1) ... [2018-12-31 03:56:58,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:57" (1/1) ... [2018-12-31 03:56:58,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:57" (1/1) ... [2018-12-31 03:56:58,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:57" (1/1) ... [2018-12-31 03:56:58,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:57" (1/1) ... [2018-12-31 03:56:58,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:57" (1/1) ... [2018-12-31 03:56:58,175 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:57" (1/1) ... [2018-12-31 03:56:58,184 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:56:58,188 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:56:58,188 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:56:58,188 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:56:58,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:56:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-31 03:56:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:56:58,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:56:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:56:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:56:58,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:56:58,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 03:56:58,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:56:58,603 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:03,251 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:03,377 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:23,245 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:57:23,270 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:57:23,270 INFO L280 CfgBuilder]: Removed 16 assue(true) statements. [2018-12-31 03:57:23,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:57:23 BoogieIcfgContainer [2018-12-31 03:57:23,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:57:23,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:57:23,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:57:23,276 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:57:23,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:56:57" (1/3) ... [2018-12-31 03:57:23,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac07915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:57:23, skipping insertion in model container [2018-12-31 03:57:23,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:56:57" (2/3) ... [2018-12-31 03:57:23,279 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac07915 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:57:23, skipping insertion in model container [2018-12-31 03:57:23,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:57:23" (3/3) ... [2018-12-31 03:57:23,281 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0930_true-unreach-call.c [2018-12-31 03:57:23,292 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:57:23,303 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:57:23,322 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:57:23,357 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:57:23,358 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:57:23,358 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:57:23,359 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:57:23,360 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:57:23,360 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:57:23,360 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:57:23,360 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:57:23,361 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:57:23,374 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-12-31 03:57:23,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:57:23,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:23,382 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:23,384 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:23,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:23,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1030213693, now seen corresponding path program 1 times [2018-12-31 03:57:23,394 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:23,395 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:57:23,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 03:57:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:24,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:24,352 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:24,352 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:24,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:24,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:57:24,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:57:24,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:57:24,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:57:24,414 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-12-31 03:57:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:57:24,437 INFO L93 Difference]: Finished difference Result 64 states and 104 transitions. [2018-12-31 03:57:24,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:57:24,439 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 03:57:24,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:57:24,453 INFO L225 Difference]: With dead ends: 64 [2018-12-31 03:57:24,454 INFO L226 Difference]: Without dead ends: 30 [2018-12-31 03:57:24,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:57:24,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-31 03:57:24,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-31 03:57:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 03:57:24,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2018-12-31 03:57:24,513 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 10 [2018-12-31 03:57:24,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:57:24,515 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2018-12-31 03:57:24,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:57:24,516 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2018-12-31 03:57:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:57:24,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:24,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:24,518 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:24,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:24,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1305093504, now seen corresponding path program 1 times [2018-12-31 03:57:24,521 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:24,521 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:57:24,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 03:57:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:25,412 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:25,556 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:25,556 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:25,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:25,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:57:25,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:57:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:57:25,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:57:25,586 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand 4 states. [2018-12-31 03:57:29,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:57:29,371 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2018-12-31 03:57:30,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:57:30,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 03:57:30,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:57:30,129 INFO L225 Difference]: With dead ends: 50 [2018-12-31 03:57:30,129 INFO L226 Difference]: Without dead ends: 26 [2018-12-31 03:57:30,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:57:30,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-31 03:57:30,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-31 03:57:30,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-31 03:57:30,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2018-12-31 03:57:30,136 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 11 [2018-12-31 03:57:30,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:57:30,136 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2018-12-31 03:57:30,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:57:30,137 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2018-12-31 03:57:30,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:57:30,138 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:30,138 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:30,139 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:30,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:30,139 INFO L82 PathProgramCache]: Analyzing trace with hash 464469069, now seen corresponding path program 1 times [2018-12-31 03:57:30,141 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:30,141 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) [2018-12-31 03:57:30,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:57:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:30,324 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:30,456 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:30,456 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:30,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:30,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:57:30,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 03:57:30,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 03:57:30,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:57:30,471 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 5 states. [2018-12-31 03:57:47,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:57:47,526 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-12-31 03:57:47,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:57:47,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-31 03:57:47,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:57:47,531 INFO L225 Difference]: With dead ends: 47 [2018-12-31 03:57:47,531 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 03:57:47,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:57:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 03:57:47,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2018-12-31 03:57:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:57:47,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-31 03:57:47,541 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2018-12-31 03:57:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:57:47,541 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-31 03:57:47,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 03:57:47,541 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-12-31 03:57:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:57:47,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:57:47,543 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:57:47,543 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:57:47,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:57:47,544 INFO L82 PathProgramCache]: Analyzing trace with hash 466316111, now seen corresponding path program 1 times [2018-12-31 03:57:47,544 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:57:47,544 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:57:47,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:57:48,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:57:48,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:57:48,542 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:48,542 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:57:48,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:57:48,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:57:48,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:57:48,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:57:48,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:57:48,566 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 7 states. [2018-12-31 03:58:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:13,663 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2018-12-31 03:58:13,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:58:13,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-31 03:58:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:13,735 INFO L225 Difference]: With dead ends: 46 [2018-12-31 03:58:13,735 INFO L226 Difference]: Without dead ends: 37 [2018-12-31 03:58:13,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-31 03:58:13,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-31 03:58:13,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2018-12-31 03:58:13,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:58:13,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-12-31 03:58:13,743 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 17 [2018-12-31 03:58:13,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:13,743 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-12-31 03:58:13,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:58:13,744 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-12-31 03:58:13,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:58:13,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:13,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:13,746 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:13,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:13,746 INFO L82 PathProgramCache]: Analyzing trace with hash 671337773, now seen corresponding path program 1 times [2018-12-31 03:58:13,747 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:13,747 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:13,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:14,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:14,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:14,902 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 132 treesize of output 126 [2018-12-31 03:58:14,928 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 126 treesize of output 121 [2018-12-31 03:58:14,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 60 [2018-12-31 03:58:14,968 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:58:14,979 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:58:14,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:58:15,038 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:15,040 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:158, output treesize:86 [2018-12-31 03:58:15,154 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:15,154 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:15,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:15,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:58:15,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:58:15,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:58:15,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:58:15,188 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 7 states. [2018-12-31 03:58:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:17,778 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-12-31 03:58:17,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:58:17,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-31 03:58:17,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:17,781 INFO L225 Difference]: With dead ends: 35 [2018-12-31 03:58:17,781 INFO L226 Difference]: Without dead ends: 22 [2018-12-31 03:58:17,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-31 03:58:17,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-12-31 03:58:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-12-31 03:58:17,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-12-31 03:58:17,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2018-12-31 03:58:17,789 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 17 [2018-12-31 03:58:17,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:17,789 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2018-12-31 03:58:17,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:58:17,789 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2018-12-31 03:58:17,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-31 03:58:17,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:17,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:17,792 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:17,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:17,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1561479138, now seen corresponding path program 1 times [2018-12-31 03:58:17,792 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:17,793 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:58:17,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:17,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:18,156 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:18,156 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:18,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:18,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-31 03:58:18,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 03:58:18,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 03:58:18,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 03:58:18,171 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand 9 states. [2018-12-31 03:58:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:18,532 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2018-12-31 03:58:18,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-31 03:58:18,535 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2018-12-31 03:58:18,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:18,536 INFO L225 Difference]: With dead ends: 22 [2018-12-31 03:58:18,537 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:58:18,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2018-12-31 03:58:18,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:58:18,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:58:18,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:58:18,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:58:18,539 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-12-31 03:58:18,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:18,539 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:58:18,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 03:58:18,539 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:58:18,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:58:18,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:58:18,815 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-12-31 03:58:18,977 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2018-12-31 03:58:19,201 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-12-31 03:58:19,205 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2018-12-31 03:58:19,206 INFO L444 ceAbstractionStarter]: At program point L135(lines 126 136) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (bvand (_ bv1048576 32) (bvadd ULTIMATE.start___ieee754_log_~hx~1 (_ bv614244 32))) ULTIMATE.start___ieee754_log_~i~0) (= |ULTIMATE.start___ieee754_log_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short16| (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (exists ((v_prenex_11 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_log_~x (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (= ULTIMATE.start___ieee754_log_~hx~1 (bvand (_ bv1048575 32) ((_ extract 63 32) v_prenex_11))))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start___ieee754_log_~f~0 (fp.sub roundNearestTiesToEven .cse0 .cse0)) (= .cse0 ULTIMATE.start___ieee754_log_~x) (= (_ bv0 32) |ULTIMATE.start___signbit_double_#res|) (= (_ +zero 11 53) ~zero~0) (exists ((v_prenex_12 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) v_prenex_12)) (= (fp ((_ extract 63 63) v_prenex_12) ((_ extract 62 52) v_prenex_12) ((_ extract 51 0) v_prenex_12)) (_ +zero 11 53)))))) [2018-12-31 03:58:19,206 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2018-12-31 03:58:19,206 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:58:19,206 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2018-12-31 03:58:19,206 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:58:19,207 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2018-12-31 03:58:19,208 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2018-12-31 03:58:19,208 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2018-12-31 03:58:19,208 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 129 133) no Hoare annotation was computed. [2018-12-31 03:58:19,209 INFO L444 ceAbstractionStarter]: At program point L129-2(lines 129 133) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= (bvand (_ bv1048576 32) (bvadd ULTIMATE.start___ieee754_log_~hx~1 (_ bv614244 32))) ULTIMATE.start___ieee754_log_~i~0) (= |ULTIMATE.start___ieee754_log_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short16| (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (exists ((v_prenex_11 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_log_~x (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (= ULTIMATE.start___ieee754_log_~hx~1 (bvand (_ bv1048575 32) ((_ extract 63 32) v_prenex_11))))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start___ieee754_log_~f~0 (fp.sub roundNearestTiesToEven .cse0 .cse0)) (= .cse0 ULTIMATE.start___ieee754_log_~x) (= (_ +zero 11 53) ~zero~0))) [2018-12-31 03:58:19,209 INFO L448 ceAbstractionStarter]: For program point L129-3(lines 129 133) no Hoare annotation was computed. [2018-12-31 03:58:19,209 INFO L451 ceAbstractionStarter]: At program point L154(lines 138 155) the Hoare annotation is: true [2018-12-31 03:58:19,209 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2018-12-31 03:58:19,209 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-12-31 03:58:19,211 INFO L444 ceAbstractionStarter]: At program point L122(lines 45 124) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (= |ULTIMATE.start___ieee754_log_#res| (_ +zero 11 53)) (exists ((v_prenex_11 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_log_~x (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (= ULTIMATE.start___ieee754_log_~hx~1 (bvand (_ bv1048575 32) ((_ extract 63 32) v_prenex_11))))) (= ULTIMATE.start___ieee754_log_~f~0 (fp.sub roundNearestTiesToEven .cse0 .cse0)) (= .cse0 ULTIMATE.start___ieee754_log_~x) (= (_ +zero 11 53) ~zero~0) (exists ((v_prenex_10 (_ BitVec 64))) (let ((.cse1 ((_ extract 63 32) v_prenex_10))) (and (= (bvand (_ bv1048576 32) (bvadd (bvand (_ bv1048575 32) .cse1) (_ bv614244 32))) ULTIMATE.start___ieee754_log_~i~0) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (= (bvadd (bvashr .cse1 (_ bv20 32)) (_ bv4294966273 32)) ULTIMATE.start___ieee754_log_~k~0)))))) [2018-12-31 03:58:19,211 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2018-12-31 03:58:19,212 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:58:19,212 INFO L444 ceAbstractionStarter]: At program point L65-2(lines 65 69) the Hoare annotation is: false [2018-12-31 03:58:19,212 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:58:19,212 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2018-12-31 03:58:19,212 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2018-12-31 03:58:19,212 INFO L448 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2018-12-31 03:58:19,212 INFO L448 ceAbstractionStarter]: For program point L149-2(lines 149 152) no Hoare annotation was computed. [2018-12-31 03:58:19,214 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2018-12-31 03:58:19,214 INFO L444 ceAbstractionStarter]: At program point L50-2(lines 50 55) the Hoare annotation is: (and (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ULTIMATE.start___ieee754_log_~x) (= (_ +zero 11 53) ~zero~0)) [2018-12-31 03:58:19,215 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 50 55) no Hoare annotation was computed. [2018-12-31 03:58:19,215 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2018-12-31 03:58:19,215 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-12-31 03:58:19,215 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2018-12-31 03:58:19,215 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2018-12-31 03:58:19,215 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 81) the Hoare annotation is: (and (exists ((v_prenex_11 (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_log_~x (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))) (= ULTIMATE.start___ieee754_log_~hx~1 (bvand (_ bv1048575 32) ((_ extract 63 32) v_prenex_11))))) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) ULTIMATE.start___ieee754_log_~x) (= (_ +zero 11 53) ~zero~0) (exists ((v_prenex_10 (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_prenex_10))) (and (= (bvand (_ bv1048576 32) (bvadd (bvand (_ bv1048575 32) .cse0) (_ bv614244 32))) ULTIMATE.start___ieee754_log_~i~0) (= ((_ to_fp 11 53) roundNearestTiesToEven 1.0) (fp ((_ extract 63 63) v_prenex_10) ((_ extract 62 52) v_prenex_10) ((_ extract 51 0) v_prenex_10))) (= (bvadd (bvashr .cse0 (_ bv20 32)) (_ bv4294966273 32)) ULTIMATE.start___ieee754_log_~k~0))))) [2018-12-31 03:58:19,216 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 76 81) no Hoare annotation was computed. [2018-12-31 03:58:19,224 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,225 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,226 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,231 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,231 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,231 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,232 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,237 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,240 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,240 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,241 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,241 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,241 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,246 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,248 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,248 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,248 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,248 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,249 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,249 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,251 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,252 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,254 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,254 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,254 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,254 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,255 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,255 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,256 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,257 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,258 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,263 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,263 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,264 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,264 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,265 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,266 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,267 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,267 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,268 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,268 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,269 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,269 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,270 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,271 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,279 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,280 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,280 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,280 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,280 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,281 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,281 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,285 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,286 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,286 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,287 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,287 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,287 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,287 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,288 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:58:19 BoogieIcfgContainer [2018-12-31 03:58:19,290 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:58:19,291 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:58:19,291 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:58:19,291 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:58:19,292 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:23" (3/4) ... [2018-12-31 03:58:19,297 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:58:19,311 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-31 03:58:19,312 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-31 03:58:19,338 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == ~Pluszero~LONGDOUBLE() && (\exists v_prenex_11 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]) && hx == ~bvand32(1048575bv32, v_prenex_11[63:32]))) && f == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == x) && ~Pluszero~LONGDOUBLE() == zero) && (\exists v_prenex_10 : bv64 :: (~bvand32(1048576bv32, ~bvadd64(~bvand32(1048575bv32, v_prenex_10[63:32]), 614244bv32)) == i && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == ~fp~LONGDOUBLE(v_prenex_10[63:63], v_prenex_10[62:52], v_prenex_10[51:0])) && ~bvadd64(~bvashr32(v_prenex_10[63:32], 20bv32), 4294966273bv32) == k) [2018-12-31 03:58:19,339 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_prenex_11 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]) && hx == ~bvand32(1048575bv32, v_prenex_11[63:32])) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == x) && ~Pluszero~LONGDOUBLE() == zero) && (\exists v_prenex_10 : bv64 :: (~bvand32(1048576bv32, ~bvadd64(~bvand32(1048575bv32, v_prenex_10[63:32]), 614244bv32)) == i && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == ~fp~LONGDOUBLE(v_prenex_10[63:63], v_prenex_10[62:52], v_prenex_10[51:0])) && ~bvadd64(~bvashr32(v_prenex_10[63:32], 20bv32), 4294966273bv32) == k) [2018-12-31 03:58:19,339 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~bvand32(1048576bv32, ~bvadd64(hx, 614244bv32)) == i && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && res == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_11 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]) && hx == ~bvand32(1048575bv32, v_prenex_11[63:32]))) && ~Pluszero~LONGDOUBLE() == x) && f == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == x) && ~Pluszero~LONGDOUBLE() == zero [2018-12-31 03:58:19,340 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((~bvand32(1048576bv32, ~bvadd64(hx, 614244bv32)) == i && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && res == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_11 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]) && hx == ~bvand32(1048575bv32, v_prenex_11[63:32]))) && ~Pluszero~LONGDOUBLE() == x) && f == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == x) && 0bv32 == \result) && ~Pluszero~LONGDOUBLE() == zero) && (\exists v_prenex_12 : bv64 :: msw == v_prenex_12[63:32] && ~fp~LONGDOUBLE(v_prenex_12[63:63], v_prenex_12[62:52], v_prenex_12[51:0]) == ~Pluszero~LONGDOUBLE()) [2018-12-31 03:58:19,397 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:58:19,397 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:58:19,401 INFO L168 Benchmark]: Toolchain (without parser) took 82019.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 948.7 MB in the beginning and 854.7 MB in the end (delta: 93.9 MB). Peak memory consumption was 215.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:19,402 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:19,402 INFO L168 Benchmark]: CACSL2BoogieTranslator took 554.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:19,402 INFO L168 Benchmark]: Boogie Procedure Inliner took 165.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:19,403 INFO L168 Benchmark]: Boogie Preprocessor took 85.45 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:58:19,404 INFO L168 Benchmark]: RCFGBuilder took 25083.16 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.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:19,404 INFO L168 Benchmark]: TraceAbstraction took 56018.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 861.6 MB in the end (delta: 206.5 MB). Peak memory consumption was 206.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:19,405 INFO L168 Benchmark]: Witness Printer took 106.23 ms. Allocated memory is still 1.2 GB. Free memory was 861.6 MB in the beginning and 854.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:19,409 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 554.94 ms. Allocated memory is still 1.0 GB. Free memory was 948.7 MB in the beginning and 932.6 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 165.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 932.6 MB in the beginning and 1.1 GB in the end (delta: -175.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 85.45 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 25083.16 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.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 56018.17 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 861.6 MB in the end (delta: 206.5 MB). Peak memory consumption was 206.5 MB. Max. memory is 11.5 GB. * Witness Printer took 106.23 ms. Allocated memory is still 1.2 GB. Free memory was 861.6 MB in the beginning and 854.7 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - 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_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - 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_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - 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_10,QUANTIFIED] - 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_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - 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_10,QUANTIFIED] - 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_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,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_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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: 129]: Loop Invariant [2018-12-31 03:58:19,417 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,425 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,426 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,427 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,427 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,428 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,433 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((~bvand32(1048576bv32, ~bvadd64(hx, 614244bv32)) == i && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && res == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_11 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]) && hx == ~bvand32(1048575bv32, v_prenex_11[63:32]))) && ~Pluszero~LONGDOUBLE() == x) && f == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == x) && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 45]: Loop Invariant [2018-12-31 03:58:19,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,434 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,434 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,435 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,435 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,435 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,435 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,435 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,436 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,437 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,437 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,443 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,443 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] Derived loop invariant: ((((\result == ~Pluszero~LONGDOUBLE() && (\exists v_prenex_11 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]) && hx == ~bvand32(1048575bv32, v_prenex_11[63:32]))) && f == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == x) && ~Pluszero~LONGDOUBLE() == zero) && (\exists v_prenex_10 : bv64 :: (~bvand32(1048576bv32, ~bvadd64(~bvand32(1048575bv32, v_prenex_10[63:32]), 614244bv32)) == i && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == ~fp~LONGDOUBLE(v_prenex_10[63:63], v_prenex_10[62:52], v_prenex_10[51:0])) && ~bvadd64(~bvashr32(v_prenex_10[63:32], 20bv32), 4294966273bv32) == k) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 76]: Loop Invariant [2018-12-31 03:58:19,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,445 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,445 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,447 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,447 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,447 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] [2018-12-31 03:58:19,448 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_10,QUANTIFIED] Derived loop invariant: (((\exists v_prenex_11 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]) && hx == ~bvand32(1048575bv32, v_prenex_11[63:32])) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == x) && ~Pluszero~LONGDOUBLE() == zero) && (\exists v_prenex_10 : bv64 :: (~bvand32(1048576bv32, ~bvadd64(~bvand32(1048575bv32, v_prenex_10[63:32]), 614244bv32)) == i && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == ~fp~LONGDOUBLE(v_prenex_10[63:63], v_prenex_10[62:52], v_prenex_10[51:0])) && ~bvadd64(~bvashr32(v_prenex_10[63:32], 20bv32), 4294966273bv32) == k) - InvariantResult [Line: 50]: Loop Invariant [2018-12-31 03:58:19,448 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,453 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == x && ~Pluszero~LONGDOUBLE() == zero - InvariantResult [Line: 126]: Loop Invariant [2018-12-31 03:58:19,453 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,454 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,454 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,454 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,454 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,457 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,457 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,458 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,458 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,458 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,458 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:19,459 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,459 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,459 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,459 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:58:19,459 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,459 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] [2018-12-31 03:58:19,466 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_12,QUANTIFIED] Derived loop invariant: (((((((((~bvand32(1048576bv32, ~bvadd64(hx, 614244bv32)) == i && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && res == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_11 : bv64 :: x == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]) && hx == ~bvand32(1048575bv32, v_prenex_11[63:32]))) && ~Pluszero~LONGDOUBLE() == x) && f == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0) == x) && 0bv32 == \result) && ~Pluszero~LONGDOUBLE() == zero) && (\exists v_prenex_12 : bv64 :: msw == v_prenex_12[63:32] && ~fp~LONGDOUBLE(v_prenex_12[63:63], v_prenex_12[62:52], v_prenex_12[51:0]) == ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. SAFE Result, 55.8s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 49.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 151 SDtfs, 139 SDslu, 245 SDs, 0 SdLazy, 104 SolverSat, 22 SolverUnsat, 18 SolverUnknown, 0 SolverNotchecked, 45.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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, 6 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 262 HoareAnnotationTreeSize, 7 FomulaSimplifications, 116 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 87 ConstructedInterpolants, 20 QuantifiedInterpolants, 10493 SizeOfPredicates, 28 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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...