./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78c6d2d68aa498895f40ed0a4a24644b21119801 .............................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78c6d2d68aa498895f40ed0a4a24644b21119801 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:07:17,174 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:07:17,176 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:07:17,191 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:07:17,191 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:07:17,192 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:07:17,195 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:07:17,198 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:07:17,199 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:07:17,201 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:07:17,203 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:07:17,203 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:07:17,205 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:07:17,206 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:07:17,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:07:17,215 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:07:17,216 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:07:17,221 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:07:17,226 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:07:17,229 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:07:17,230 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:07:17,233 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:07:17,235 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:07:17,235 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:07:17,237 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:07:17,238 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:07:17,240 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:07:17,241 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:07:17,242 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:07:17,244 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:07:17,245 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:07:17,245 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:07:17,246 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:07:17,247 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:07:17,248 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:07:17,249 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:07:17,249 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:07:17,276 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:07:17,276 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:07:17,277 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:07:17,277 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:07:17,277 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:07:17,278 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:07:17,278 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:07:17,279 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:07:17,279 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:07:17,279 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:07:17,279 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:07:17,279 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:07:17,279 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:07:17,280 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:07:17,280 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:07:17,280 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:07:17,280 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:07:17,280 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:07:17,280 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:07:17,281 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:07:17,282 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:07:17,282 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:07:17,282 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:07:17,283 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:07:17,283 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:07:17,283 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:07:17,283 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:07:17,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:07:17,283 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78c6d2d68aa498895f40ed0a4a24644b21119801 [2019-01-12 09:07:17,337 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:07:17,349 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:07:17,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:07:17,359 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:07:17,359 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:07:17,360 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c [2019-01-12 09:07:17,409 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c01c2bc/cc76cbc26ee94b6cbc190cb49d6538aa/FLAG153ca065f [2019-01-12 09:07:17,908 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:07:17,910 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c [2019-01-12 09:07:17,921 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c01c2bc/cc76cbc26ee94b6cbc190cb49d6538aa/FLAG153ca065f [2019-01-12 09:07:18,216 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00c01c2bc/cc76cbc26ee94b6cbc190cb49d6538aa [2019-01-12 09:07:18,224 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:07:18,226 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:07:18,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:07:18,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:07:18,231 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:07:18,232 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:07:18" (1/1) ... [2019-01-12 09:07:18,235 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e34980e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18, skipping insertion in model container [2019-01-12 09:07:18,235 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:07:18" (1/1) ... [2019-01-12 09:07:18,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:07:18,274 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:07:18,620 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:07:18,626 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:07:18,715 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:07:18,748 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:07:18,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18 WrapperNode [2019-01-12 09:07:18,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:07:18,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:07:18,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:07:18,751 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:07:18,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18" (1/1) ... [2019-01-12 09:07:18,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18" (1/1) ... [2019-01-12 09:07:18,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:07:18,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:07:18,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:07:18,898 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:07:18,906 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18" (1/1) ... [2019-01-12 09:07:18,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18" (1/1) ... [2019-01-12 09:07:18,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18" (1/1) ... [2019-01-12 09:07:18,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18" (1/1) ... [2019-01-12 09:07:18,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18" (1/1) ... [2019-01-12 09:07:18,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18" (1/1) ... [2019-01-12 09:07:18,947 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18" (1/1) ... [2019-01-12 09:07:18,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:07:18,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:07:18,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:07:18,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:07:18,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:07:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:07:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:07:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:07:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:07:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:07:19,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:07:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:07:19,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:07:19,790 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:07:19,791 INFO L286 CfgBuilder]: Removed 24 assue(true) statements. [2019-01-12 09:07:19,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:19 BoogieIcfgContainer [2019-01-12 09:07:19,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:07:19,793 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:07:19,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:07:19,797 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:07:19,797 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:07:18" (1/3) ... [2019-01-12 09:07:19,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6d92f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:07:19, skipping insertion in model container [2019-01-12 09:07:19,798 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:18" (2/3) ... [2019-01-12 09:07:19,798 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d6d92f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:07:19, skipping insertion in model container [2019-01-12 09:07:19,799 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:19" (3/3) ... [2019-01-12 09:07:19,800 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0960b_true-unreach-call.c [2019-01-12 09:07:19,811 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:07:19,819 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:07:19,837 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:07:19,869 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:07:19,870 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:07:19,870 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:07:19,870 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:07:19,870 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:07:19,870 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:07:19,871 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:07:19,871 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:07:19,871 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:07:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-01-12 09:07:19,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:07:19,894 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:19,895 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:19,897 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:19,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:19,904 INFO L82 PathProgramCache]: Analyzing trace with hash -306140874, now seen corresponding path program 1 times [2019-01-12 09:07:19,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:07:19,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:07:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:07:19,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:19,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:07:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:20,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:20,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:07:20,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:07:20,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:07:20,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:07:20,071 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-01-12 09:07:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:20,091 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2019-01-12 09:07:20,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:07:20,092 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-01-12 09:07:20,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:20,104 INFO L225 Difference]: With dead ends: 88 [2019-01-12 09:07:20,104 INFO L226 Difference]: Without dead ends: 42 [2019-01-12 09:07:20,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:07:20,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-12 09:07:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-12 09:07:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 09:07:20,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2019-01-12 09:07:20,148 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 12 [2019-01-12 09:07:20,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:20,148 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2019-01-12 09:07:20,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:07:20,149 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2019-01-12 09:07:20,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:07:20,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:20,151 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:20,151 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:20,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:20,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1933005595, now seen corresponding path program 1 times [2019-01-12 09:07:20,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:07:20,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:07:20,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:07:20,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:20,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:07:20,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:07:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:07:20,390 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:07:20,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:07:20 BoogieIcfgContainer [2019-01-12 09:07:20,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:07:20,439 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:07:20,439 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:07:20,440 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:07:20,440 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:19" (3/4) ... [2019-01-12 09:07:20,444 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:07:20,444 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:07:20,445 INFO L168 Benchmark]: Toolchain (without parser) took 2220.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 942.0 MB in the beginning and 1.1 GB in the end (delta: -122.1 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:20,447 INFO L168 Benchmark]: CDTParser took 0.17 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. [2019-01-12 09:07:20,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 523.14 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 925.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:20,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 147.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -202.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:20,450 INFO L168 Benchmark]: Boogie Preprocessor took 53.17 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:07:20,450 INFO L168 Benchmark]: RCFGBuilder took 840.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:20,451 INFO L168 Benchmark]: TraceAbstraction took 645.49 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.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:07:20,452 INFO L168 Benchmark]: Witness Printer took 5.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:07:20,457 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 523.14 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 925.9 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 147.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 925.9 MB in the beginning and 1.1 GB in the end (delta: -202.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 53.17 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 840.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.0 MB). Peak memory consumption was 31.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 645.49 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.2 MB). Peak memory consumption was 33.2 MB. Max. memory is 11.5 GB. * Witness Printer took 5.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 186]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 27, overapproximation of someUnaryDOUBLEoperation at line 181, overapproximation of someBinaryArithmeticDOUBLEoperation at line 148, overapproximation of bitwiseAnd at line 26. Possible FailurePath: [L32-L41] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L43] static const double zero = 0.0; [L126-L129] static const double two54_log10 = 1.80143985094819840000e+16, ivln10_log10 = 4.34294481903251816668e-01, log10_2hi_log10 = 3.01029995663611771306e-01, log10_2lo_log10 = 3.69423907715893078616e-13; [L131] static const double zero_log10 = 0.0; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L181] double x = -0.0; [L134] double y, z; [L135] __int32_t i, k, hx; [L136] __uint32_t lx; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L139] ieee_double_shape_type ew_u; [L140] ew_u.value = (x) [L141] EXPR ew_u.parts.msw [L141] (hx) = ew_u.parts.msw [L142] EXPR ew_u.parts.lsw [L142] (lx) = ew_u.parts.lsw [L145] k = 0 VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L146] COND TRUE hx < 0x00100000 VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L147] COND TRUE ((hx & 0x7fffffff) | lx) == 0 [L148] return -two54_log10 / zero_log10; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L182] double res = __ieee754_log10(x); [L19] __int32_t hx, lx; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (hx) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lx) = ew_u.parts.lsw [L26] hx &= 0x7fffffff [L27] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L28] hx = 0x7ff00000 - hx [L29] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L185] COND TRUE !isinf_double(res) [L186] __VERIFIER_error() VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. UNSAFE Result, 0.5s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 121 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:07:22,838 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:07:22,840 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:07:22,852 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:07:22,852 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:07:22,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:07:22,855 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:07:22,856 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:07:22,858 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:07:22,859 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:07:22,860 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:07:22,860 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:07:22,861 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:07:22,862 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:07:22,863 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:07:22,864 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:07:22,865 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:07:22,866 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:07:22,868 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:07:22,870 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:07:22,871 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:07:22,872 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:07:22,874 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:07:22,875 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:07:22,875 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:07:22,876 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:07:22,877 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:07:22,877 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:07:22,878 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:07:22,879 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:07:22,880 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:07:22,880 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:07:22,880 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:07:22,881 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:07:22,882 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:07:22,882 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:07:22,883 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:07:22,900 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:07:22,900 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:07:22,902 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:07:22,902 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:07:22,902 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:07:22,902 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:07:22,902 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:07:22,903 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:07:22,903 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:07:22,903 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:07:22,903 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:07:22,903 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:07:22,903 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:07:22,904 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:07:22,904 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:07:22,904 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:07:22,904 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:07:22,904 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:07:22,905 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:07:22,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:07:22,905 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:07:22,905 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:07:22,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:07:22,906 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:07:22,906 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:07:22,906 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:07:22,906 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:07:22,906 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:07:22,906 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:07:22,907 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:07:22,907 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 78c6d2d68aa498895f40ed0a4a24644b21119801 [2019-01-12 09:07:22,962 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:07:22,979 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:07:22,984 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:07:22,986 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:07:22,986 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:07:22,987 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c [2019-01-12 09:07:23,050 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37d12170/71ec28f911c54eeea0f31d84ea7f203b/FLAG57240f32d [2019-01-12 09:07:23,531 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:07:23,531 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0960b_true-unreach-call.c [2019-01-12 09:07:23,539 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37d12170/71ec28f911c54eeea0f31d84ea7f203b/FLAG57240f32d [2019-01-12 09:07:23,847 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e37d12170/71ec28f911c54eeea0f31d84ea7f203b [2019-01-12 09:07:23,850 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:07:23,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:07:23,853 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:07:23,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:07:23,857 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:07:23,858 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:07:23" (1/1) ... [2019-01-12 09:07:23,862 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53893820 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:23, skipping insertion in model container [2019-01-12 09:07:23,862 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:07:23" (1/1) ... [2019-01-12 09:07:23,872 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:07:23,898 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:07:24,226 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:07:24,237 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:07:24,292 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:07:24,328 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:07:24,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24 WrapperNode [2019-01-12 09:07:24,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:07:24,330 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:07:24,330 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:07:24,330 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:07:24,406 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24" (1/1) ... [2019-01-12 09:07:24,426 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24" (1/1) ... [2019-01-12 09:07:24,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:07:24,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:07:24,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:07:24,481 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:07:24,493 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24" (1/1) ... [2019-01-12 09:07:24,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24" (1/1) ... [2019-01-12 09:07:24,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24" (1/1) ... [2019-01-12 09:07:24,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24" (1/1) ... [2019-01-12 09:07:24,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24" (1/1) ... [2019-01-12 09:07:24,551 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24" (1/1) ... [2019-01-12 09:07:24,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24" (1/1) ... [2019-01-12 09:07:24,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:07:24,560 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:07:24,560 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:07:24,561 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:07:24,561 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:07:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:07:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:07:24,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:07:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:07:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:07:24,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:07:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:07:24,628 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:07:29,265 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:50,205 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:50,282 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:50,598 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:50,697 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:55,524 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:55,625 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:07:55,720 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:07:55,721 INFO L286 CfgBuilder]: Removed 24 assue(true) statements. [2019-01-12 09:07:55,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:55 BoogieIcfgContainer [2019-01-12 09:07:55,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:07:55,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:07:55,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:07:55,727 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:07:55,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:07:23" (1/3) ... [2019-01-12 09:07:55,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63776f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:07:55, skipping insertion in model container [2019-01-12 09:07:55,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:07:24" (2/3) ... [2019-01-12 09:07:55,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63776f9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:07:55, skipping insertion in model container [2019-01-12 09:07:55,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:55" (3/3) ... [2019-01-12 09:07:55,732 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0960b_true-unreach-call.c [2019-01-12 09:07:55,744 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:07:55,753 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:07:55,771 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:07:55,808 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:07:55,809 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:07:55,810 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:07:55,810 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:07:55,810 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:07:55,810 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:07:55,810 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:07:55,810 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:07:55,811 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:07:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-01-12 09:07:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-12 09:07:55,838 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:55,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:55,842 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:55,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:55,850 INFO L82 PathProgramCache]: Analyzing trace with hash -306140874, now seen corresponding path program 1 times [2019-01-12 09:07:55,856 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:55,859 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:07:55,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:56,895 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:56,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:07:56,909 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:07:56,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:07:56,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:07:56,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:07:56,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:07:56,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:07:56,950 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-01-12 09:07:56,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:07:56,970 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2019-01-12 09:07:56,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:07:56,973 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-01-12 09:07:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:07:56,985 INFO L225 Difference]: With dead ends: 88 [2019-01-12 09:07:56,985 INFO L226 Difference]: Without dead ends: 42 [2019-01-12 09:07:56,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:07:57,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-01-12 09:07:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-01-12 09:07:57,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 09:07:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 56 transitions. [2019-01-12 09:07:57,034 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 56 transitions. Word has length 12 [2019-01-12 09:07:57,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:07:57,035 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 56 transitions. [2019-01-12 09:07:57,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:07:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 56 transitions. [2019-01-12 09:07:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:07:57,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:07:57,036 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:07:57,038 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:07:57,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:07:57,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1933005595, now seen corresponding path program 1 times [2019-01-12 09:07:57,040 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:07:57,042 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:07:57,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:07:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:07:58,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:07:58,440 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:58,442 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:58,448 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:58,449 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:58,457 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 98 [2019-01-12 09:07:58,767 WARN L181 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-01-12 09:07:58,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:07:58,844 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:07:58,854 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:07:58,857 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 93 [2019-01-12 09:07:59,355 WARN L181 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-01-12 09:07:59,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:07:59,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 33 [2019-01-12 09:07:59,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:07:59,465 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:59,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-12 09:07:59,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:07:59,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-12 09:07:59,578 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:07:59,586 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:59,671 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 47 treesize of output 35 [2019-01-12 09:07:59,678 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:07:59,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 25 [2019-01-12 09:07:59,681 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:07:59,732 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:59,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:07:59,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:07:59,770 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 4 variables, input treesize:88, output treesize:34 [2019-01-12 09:08:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:00,058 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:00,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:00,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:08:00,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:08:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:08:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:08:00,091 INFO L87 Difference]: Start difference. First operand 42 states and 56 transitions. Second operand 8 states. [2019-01-12 09:08:08,025 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-12 09:08:10,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:10,329 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2019-01-12 09:08:10,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:08:10,491 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-01-12 09:08:10,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:10,493 INFO L225 Difference]: With dead ends: 58 [2019-01-12 09:08:10,493 INFO L226 Difference]: Without dead ends: 50 [2019-01-12 09:08:10,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:08:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-01-12 09:08:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2019-01-12 09:08:10,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-01-12 09:08:10,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2019-01-12 09:08:10,503 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 14 [2019-01-12 09:08:10,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:10,504 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2019-01-12 09:08:10,504 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:08:10,504 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2019-01-12 09:08:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-01-12 09:08:10,506 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:10,506 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:10,506 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:10,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:10,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2124356858, now seen corresponding path program 1 times [2019-01-12 09:08:10,507 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:10,508 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:10,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:10,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:10,701 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:10,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:10,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:10,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:10,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:10,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:10,714 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 4 states. [2019-01-12 09:08:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:12,176 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2019-01-12 09:08:12,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:12,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-01-12 09:08:12,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:12,212 INFO L225 Difference]: With dead ends: 50 [2019-01-12 09:08:12,213 INFO L226 Difference]: Without dead ends: 16 [2019-01-12 09:08:12,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:08:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-01-12 09:08:12,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-01-12 09:08:12,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-01-12 09:08:12,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2019-01-12 09:08:12,217 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 14 [2019-01-12 09:08:12,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:12,217 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2019-01-12 09:08:12,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:12,218 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2019-01-12 09:08:12,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:08:12,219 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:08:12,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:08:12,219 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:08:12,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:08:12,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1233905145, now seen corresponding path program 1 times [2019-01-12 09:08:12,220 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:08:12,220 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:08:12,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:08:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:08:13,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:08:13,476 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:08:13,488 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:08:13,501 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:08:13,503 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:08:13,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 76 [2019-01-12 09:08:13,523 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:08:13,526 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 72 [2019-01-12 09:08:13,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-12 09:08:13,578 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-01-12 09:08:13,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:08:13,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:08:13,590 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:08:13,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2019-01-12 09:08:13,592 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-12 09:08:13,621 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:08:13,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-12 09:08:13,662 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:08:13,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2019-01-12 09:08:13,664 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-12 09:08:13,673 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:08:13,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:08:13,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-12 09:08:13,704 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:65, output treesize:28 [2019-01-12 09:08:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:08:13,747 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:08:13,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:08:13,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:08:13,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 09:08:13,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 09:08:13,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 09:08:13,780 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 4 states. [2019-01-12 09:08:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:08:13,854 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2019-01-12 09:08:13,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 09:08:13,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-01-12 09:08:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:08:13,856 INFO L225 Difference]: With dead ends: 16 [2019-01-12 09:08:13,856 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:08:13,857 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:08:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:08:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:08:13,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:08:13,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:08:13,858 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2019-01-12 09:08:13,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:08:13,858 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:08:13,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 09:08:13,858 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:08:13,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:08:13,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:08:14,281 INFO L448 ceAbstractionStarter]: For program point L85(lines 85 92) no Hoare annotation was computed. [2019-01-12 09:08:14,282 INFO L448 ceAbstractionStarter]: For program point L94(lines 94 99) no Hoare annotation was computed. [2019-01-12 09:08:14,282 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:08:14,282 INFO L448 ceAbstractionStarter]: For program point L61(lines 61 62) no Hoare annotation was computed. [2019-01-12 09:08:14,283 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:08:14,283 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 188) no Hoare annotation was computed. [2019-01-12 09:08:14,283 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 122) no Hoare annotation was computed. [2019-01-12 09:08:14,283 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 91) no Hoare annotation was computed. [2019-01-12 09:08:14,283 INFO L448 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2019-01-12 09:08:14,284 INFO L444 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg .cse1) (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_log10_#res| .cse0) (= .cse1 ~two54_log10~0) (= ULTIMATE.start_isinf_double_~x .cse0) (= (_ +zero 11 53) ~zero_log10~0)))) [2019-01-12 09:08:14,284 INFO L448 ceAbstractionStarter]: For program point L20-3(lines 20 25) no Hoare annotation was computed. [2019-01-12 09:08:14,284 INFO L448 ceAbstractionStarter]: For program point L111(lines 111 123) no Hoare annotation was computed. [2019-01-12 09:08:14,284 INFO L444 ceAbstractionStarter]: At program point L29(lines 18 30) the Hoare annotation is: (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg .cse4) (_ +zero 11 53)))) (and (= |ULTIMATE.start___ieee754_log10_#res| .cse0) (exists ((|v_q#valueAsBitvector_8| (_ BitVec 64)) (v_prenex_17 (_ BitVec 64))) (let ((.cse2 ((_ extract 63 32) v_prenex_17)) (.cse1 ((_ extract 31 0) v_prenex_17))) (and (= .cse1 ((_ extract 31 0) |v_q#valueAsBitvector_8|)) (= .cse2 ((_ extract 63 32) |v_q#valueAsBitvector_8|)) (= (bvadd |ULTIMATE.start_isinf_double_#res| (_ bv4294967295 32)) (bvneg (bvlshr (let ((.cse3 (bvadd (bvneg (bvor (bvand (_ bv2147483647 32) .cse2) (bvlshr (bvor .cse1 (bvneg .cse1)) (_ bv31 32)))) (_ bv2146435072 32)))) (bvor .cse3 (bvneg .cse3))) (_ bv31 32)))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_17) ((_ extract 62 52) v_prenex_17) ((_ extract 51 0) v_prenex_17)))))) (= .cse4 ~two54_log10~0) (= ULTIMATE.start_isinf_double_~x .cse0) (= (_ +zero 11 53) ~zero_log10~0)))) [2019-01-12 09:08:14,284 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 09:08:14,285 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 153 157) no Hoare annotation was computed. [2019-01-12 09:08:14,288 INFO L444 ceAbstractionStarter]: At program point L153-2(lines 153 157) the Hoare annotation is: false [2019-01-12 09:08:14,288 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 186) no Hoare annotation was computed. [2019-01-12 09:08:14,288 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 158) no Hoare annotation was computed. [2019-01-12 09:08:14,288 INFO L448 ceAbstractionStarter]: For program point L146-1(lines 133 173) no Hoare annotation was computed. [2019-01-12 09:08:14,288 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 117) no Hoare annotation was computed. [2019-01-12 09:08:14,288 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 138 143) no Hoare annotation was computed. [2019-01-12 09:08:14,289 INFO L444 ceAbstractionStarter]: At program point L138-2(lines 138 143) the Hoare annotation is: (and (= ULTIMATE.start___ieee754_log10_~x (fp.neg (_ +zero 11 53))) (= ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0) ~two54_log10~0) (= (_ +zero 11 53) ~zero_log10~0)) [2019-01-12 09:08:14,289 INFO L448 ceAbstractionStarter]: For program point L138-3(lines 138 143) no Hoare annotation was computed. [2019-01-12 09:08:14,290 INFO L444 ceAbstractionStarter]: At program point L122(lines 45 124) the Hoare annotation is: false [2019-01-12 09:08:14,290 INFO L448 ceAbstractionStarter]: For program point L147(lines 147 148) no Hoare annotation was computed. [2019-01-12 09:08:14,290 INFO L444 ceAbstractionStarter]: At program point L172(lines 133 173) the Hoare annotation is: (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 18014398509481984.0))) (and (= |ULTIMATE.start___ieee754_log10_#res| (fp.div roundNearestTiesToEven (fp.neg .cse0) (_ +zero 11 53))) (= .cse0 ~two54_log10~0) (= (_ +zero 11 53) ~zero_log10~0))) [2019-01-12 09:08:14,290 INFO L448 ceAbstractionStarter]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2019-01-12 09:08:14,290 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:08:14,290 INFO L444 ceAbstractionStarter]: At program point L65-2(lines 65 69) the Hoare annotation is: false [2019-01-12 09:08:14,290 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 165 170) no Hoare annotation was computed. [2019-01-12 09:08:14,290 INFO L444 ceAbstractionStarter]: At program point L165-2(lines 165 170) the Hoare annotation is: false [2019-01-12 09:08:14,291 INFO L448 ceAbstractionStarter]: For program point L165-3(lines 165 170) no Hoare annotation was computed. [2019-01-12 09:08:14,291 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:08:14,291 INFO L451 ceAbstractionStarter]: At program point L190(lines 175 191) the Hoare annotation is: true [2019-01-12 09:08:14,291 INFO L448 ceAbstractionStarter]: For program point L58(lines 58 70) no Hoare annotation was computed. [2019-01-12 09:08:14,291 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 45 124) no Hoare annotation was computed. [2019-01-12 09:08:14,291 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 150) no Hoare annotation was computed. [2019-01-12 09:08:14,291 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 50 55) no Hoare annotation was computed. [2019-01-12 09:08:14,292 INFO L444 ceAbstractionStarter]: At program point L50-2(lines 50 55) the Hoare annotation is: false [2019-01-12 09:08:14,294 INFO L448 ceAbstractionStarter]: For program point L50-3(lines 50 55) no Hoare annotation was computed. [2019-01-12 09:08:14,294 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 60) no Hoare annotation was computed. [2019-01-12 09:08:14,294 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 100) no Hoare annotation was computed. [2019-01-12 09:08:14,294 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 81) no Hoare annotation was computed. [2019-01-12 09:08:14,295 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 81) the Hoare annotation is: false [2019-01-12 09:08:14,295 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 76 81) no Hoare annotation was computed. [2019-01-12 09:08:14,307 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,308 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,308 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,311 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,311 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,311 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,312 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,313 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,313 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,313 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,313 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,314 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,314 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,315 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,315 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,315 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,317 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,317 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,318 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,318 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2019-01-12 09:08:14,318 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,319 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2019-01-12 09:08:14,319 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,319 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,319 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,320 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,320 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,320 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,321 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,321 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,321 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,321 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,321 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,321 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,322 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,322 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,323 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,323 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,324 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,325 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2019-01-12 09:08:14,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2019-01-12 09:08:14,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,326 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,327 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,328 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,329 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,330 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,330 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,331 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,332 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,332 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,332 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,334 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,335 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:08:14 BoogieIcfgContainer [2019-01-12 09:08:14,337 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:08:14,337 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:08:14,338 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:08:14,338 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:08:14,338 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:07:55" (3/4) ... [2019-01-12 09:08:14,342 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:08:14,356 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-01-12 09:08:14,357 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-12 09:08:14,357 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:08:14,389 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && ~Pluszero~LONGDOUBLE() == zero_log10 [2019-01-12 09:08:14,390 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == zero_log10 [2019-01-12 09:08:14,391 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_8 : bv64, v_prenex_17 : bv64 :: ((v_prenex_17[31:0] == v_q#valueAsBitvector_8[31:0] && v_prenex_17[63:32] == v_q#valueAsBitvector_8[63:32]) && ~bvadd64(\result, 4294967295bv32) == ~bvneg32(~bvlshr32(~bvor32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_prenex_17[63:32]), ~bvlshr32(~bvor32(v_prenex_17[31:0], ~bvneg32(v_prenex_17[31:0])), 31bv32))), 2146435072bv32), ~bvneg32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_prenex_17[63:32]), ~bvlshr32(~bvor32(v_prenex_17[31:0], ~bvneg32(v_prenex_17[31:0])), 31bv32))), 2146435072bv32))), 31bv32))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == zero_log10 [2019-01-12 09:08:14,483 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:08:14,483 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:08:14,487 INFO L168 Benchmark]: Toolchain (without parser) took 50636.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 954.0 MB in the beginning and 896.2 MB in the end (delta: 57.9 MB). Peak memory consumption was 196.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:14,488 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:08:14,488 INFO L168 Benchmark]: CACSL2BoogieTranslator took 476.07 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 937.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:14,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 151.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:14,489 INFO L168 Benchmark]: Boogie Preprocessor took 79.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:08:14,490 INFO L168 Benchmark]: RCFGBuilder took 31161.92 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: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:14,490 INFO L168 Benchmark]: TraceAbstraction took 18613.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.7 MB in the end (delta: 184.5 MB). Peak memory consumption was 184.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:14,490 INFO L168 Benchmark]: Witness Printer took 145.82 ms. Allocated memory is still 1.2 GB. Free memory was 902.7 MB in the beginning and 896.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:08:14,494 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 476.07 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 937.9 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 151.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -188.5 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.07 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 31161.92 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: 39.3 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18613.95 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 902.7 MB in the end (delta: 184.5 MB). Peak memory consumption was 184.5 MB. Max. memory is 11.5 GB. * Witness Printer took 145.82 ms. Allocated memory is still 1.2 GB. Free memory was 902.7 MB in the beginning and 896.2 MB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 186]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 133]: Loop Invariant [2019-01-12 09:08:14,507 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,507 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,508 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,508 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,508 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,512 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 153]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 09:08:14,512 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,513 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,513 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,513 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,513 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,518 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,519 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,519 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 18]: Loop Invariant [2019-01-12 09:08:14,520 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,520 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,520 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2019-01-12 09:08:14,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2019-01-12 09:08:14,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,521 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,522 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,525 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,525 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,525 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,529 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,529 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,530 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,530 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,531 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,531 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,531 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2019-01-12 09:08:14,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_8,QUANTIFIED] [2019-01-12 09:08:14,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,532 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,533 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,534 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,534 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,534 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_17,QUANTIFIED] [2019-01-12 09:08:14,541 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,541 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,541 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((\result == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_8 : bv64, v_prenex_17 : bv64 :: ((v_prenex_17[31:0] == v_q#valueAsBitvector_8[31:0] && v_prenex_17[63:32] == v_q#valueAsBitvector_8[63:32]) && ~bvadd64(\result, 4294967295bv32) == ~bvneg32(~bvlshr32(~bvor32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_prenex_17[63:32]), ~bvlshr32(~bvor32(v_prenex_17[31:0], ~bvneg32(v_prenex_17[31:0])), 31bv32))), 2146435072bv32), ~bvneg32(~bvadd64(~bvneg32(~bvor32(~bvand32(2147483647bv32, v_prenex_17[63:32]), ~bvlshr32(~bvor32(v_prenex_17[31:0], ~bvneg32(v_prenex_17[31:0])), 31bv32))), 2146435072bv32))), 31bv32))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_17[63:63], v_prenex_17[62:52], v_prenex_17[51:0]))) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16)), ~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 138]: Loop Invariant [2019-01-12 09:08:14,543 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:08:14,544 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.8014398509481984E16) == two54_log10) && ~Pluszero~LONGDOUBLE() == zero_log10 - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 175]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 45 locations, 1 error locations. SAFE Result, 18.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 12.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 123 SDtfs, 88 SDslu, 256 SDs, 0 SdLazy, 42 SolverSat, 4 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 9.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 16 NumberOfFragments, 160 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 51 ConstructedInterpolants, 11 QuantifiedInterpolants, 6347 SizeOfPredicates, 18 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...