./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0680b_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0680b_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 6672245f6516202a276f3cff39e39bf6cfceaf3d .................................................................................................................................................................................................................................................................................................................... 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_0680b_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 6672245f6516202a276f3cff39e39bf6cfceaf3d ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:51:25,785 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:51:25,787 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:51:25,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:51:25,803 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:51:25,804 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:51:25,805 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:51:25,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:51:25,811 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:51:25,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:51:25,817 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:51:25,818 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:51:25,819 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:51:25,823 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:51:25,827 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:51:25,829 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:51:25,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:51:25,837 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:51:25,839 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:51:25,840 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:51:25,842 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:51:25,847 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:51:25,852 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:51:25,855 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:51:25,855 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:51:25,856 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:51:25,857 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:51:25,857 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:51:25,861 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:51:25,862 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:51:25,862 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:51:25,865 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:51:25,866 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:51:25,866 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:51:25,867 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:51:25,868 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:51:25,868 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:51:25,883 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:51:25,883 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:51:25,884 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:51:25,884 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:51:25,884 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:51:25,885 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:51:25,885 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:51:25,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:51:25,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:51:25,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:51:25,886 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:51:25,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:51:25,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:51:25,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:51:25,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:51:25,886 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:51:25,887 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:51:25,887 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:51:25,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:51:25,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:51:25,887 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:51:25,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:51:25,888 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:51:25,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:51:25,888 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:51:25,888 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:51:25,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:51:25,888 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:51:25,889 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 -> 6672245f6516202a276f3cff39e39bf6cfceaf3d [2018-12-31 03:51:25,938 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:51:25,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:51:25,960 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:51:25,963 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:51:25,963 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:51:25,965 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0680b_true-unreach-call.c [2018-12-31 03:51:26,035 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f30aef2/d8543f65773c4add84416eabb122794a/FLAG3d43701fd [2018-12-31 03:51:26,500 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:51:26,500 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0680b_true-unreach-call.c [2018-12-31 03:51:26,512 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f30aef2/d8543f65773c4add84416eabb122794a/FLAG3d43701fd [2018-12-31 03:51:26,844 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72f30aef2/d8543f65773c4add84416eabb122794a [2018-12-31 03:51:26,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:51:26,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:51:26,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:51:26,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:51:26,855 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:51:26,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:51:26" (1/1) ... [2018-12-31 03:51:26,859 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4623a50f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:26, skipping insertion in model container [2018-12-31 03:51:26,860 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:51:26" (1/1) ... [2018-12-31 03:51:26,868 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:51:26,903 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:51:27,226 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:51:27,234 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:51:27,302 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:51:27,330 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:51:27,330 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27 WrapperNode [2018-12-31 03:51:27,331 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:51:27,332 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:51:27,332 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:51:27,332 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:51:27,412 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27" (1/1) ... [2018-12-31 03:51:27,446 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27" (1/1) ... [2018-12-31 03:51:27,493 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:51:27,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:51:27,494 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:51:27,494 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:51:27,510 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27" (1/1) ... [2018-12-31 03:51:27,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27" (1/1) ... [2018-12-31 03:51:27,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27" (1/1) ... [2018-12-31 03:51:27,522 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27" (1/1) ... [2018-12-31 03:51:27,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27" (1/1) ... [2018-12-31 03:51:27,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27" (1/1) ... [2018-12-31 03:51:27,590 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27" (1/1) ... [2018-12-31 03:51:27,607 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:51:27,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:51:27,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:51:27,608 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:51:27,609 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:51:27,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:51:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-12-31 03:51:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-31 03:51:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:51:27,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:51:27,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:51:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:51:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2018-12-31 03:51:27,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:51:29,091 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:51:29,091 INFO L280 CfgBuilder]: Removed 44 assue(true) statements. [2018-12-31 03:51:29,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:51:29 BoogieIcfgContainer [2018-12-31 03:51:29,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:51:29,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:51:29,094 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:51:29,098 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:51:29,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:51:26" (1/3) ... [2018-12-31 03:51:29,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c96d91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:51:29, skipping insertion in model container [2018-12-31 03:51:29,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:27" (2/3) ... [2018-12-31 03:51:29,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c96d91e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:51:29, skipping insertion in model container [2018-12-31 03:51:29,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:51:29" (3/3) ... [2018-12-31 03:51:29,103 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680b_true-unreach-call.c [2018-12-31 03:51:29,115 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:51:29,124 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:51:29,141 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:51:29,175 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:51:29,175 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:51:29,176 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:51:29,176 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:51:29,176 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:51:29,176 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:51:29,176 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:51:29,177 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:51:29,177 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:51:29,197 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-12-31 03:51:29,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:51:29,203 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:51:29,204 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:51:29,206 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:51:29,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:51:29,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2018-12-31 03:51:29,214 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:51:29,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:51:29,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:51:29,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:51:29,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:51:29,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:51:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:51:29,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:51:29,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:51:29,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:51:29,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:51:29,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:51:29,398 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2018-12-31 03:51:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:51:29,431 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2018-12-31 03:51:29,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:51:29,433 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 03:51:29,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:51:29,448 INFO L225 Difference]: With dead ends: 224 [2018-12-31 03:51:29,449 INFO L226 Difference]: Without dead ends: 110 [2018-12-31 03:51:29,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:51:29,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-31 03:51:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-31 03:51:29,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-31 03:51:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2018-12-31 03:51:29,508 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2018-12-31 03:51:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:51:29,509 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2018-12-31 03:51:29,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:51:29,509 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2018-12-31 03:51:29,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:51:29,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:51:29,510 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:51:29,510 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:51:29,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:51:29,511 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2018-12-31 03:51:29,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:51:29,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:51:29,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:51:29,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:51:29,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:51:29,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:51:29,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:51:29,823 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:51:29,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:51:29 BoogieIcfgContainer [2018-12-31 03:51:29,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:51:29,875 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:51:29,875 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:51:29,875 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:51:29,878 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:51:29" (3/4) ... [2018-12-31 03:51:29,884 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:51:29,884 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:51:29,885 INFO L168 Benchmark]: Toolchain (without parser) took 3036.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -67.8 MB). Peak memory consumption was 64.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:51:29,888 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:51:29,888 INFO L168 Benchmark]: CACSL2BoogieTranslator took 480.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:51:29,890 INFO L168 Benchmark]: Boogie Procedure Inliner took 161.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:51:29,891 INFO L168 Benchmark]: Boogie Preprocessor took 113.36 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:51:29,892 INFO L168 Benchmark]: RCFGBuilder took 1485.12 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: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:51:29,893 INFO L168 Benchmark]: TraceAbstraction took 781.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:51:29,894 INFO L168 Benchmark]: Witness Printer took 8.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:51:29,902 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.51 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 480.51 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 935.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 161.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 13.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 113.36 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1485.12 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: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 781.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * Witness Printer took 8.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 256]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 162, overapproximation of someUnaryDOUBLEoperation at line 251, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of someBinaryDOUBLEComparisonOperation at line 255. Possible FailurePath: [L37-L42] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L44-L49] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L51-L58] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L60-L62] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; [L139-L140] static const double tiny_atan2 = 1.0e-300, zero_atan2 = 0.0, pi_lo_atan2 = 1.2246467991473531772E-16; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L251] double x = -0.0; [L252] double y = 0.0; [L143] double z; [L144] __int32_t k, m, hx, hy, ix, iy; [L145] __uint32_t lx, ly; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L148] ieee_double_shape_type ew_u; [L149] ew_u.value = (x) [L150] EXPR ew_u.parts.msw [L150] (hx) = ew_u.parts.msw [L151] EXPR ew_u.parts.lsw [L151] (lx) = ew_u.parts.lsw [L153] ix = hx & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L155] ieee_double_shape_type ew_u; [L156] ew_u.value = (y) [L157] EXPR ew_u.parts.msw [L157] (hy) = ew_u.parts.msw [L158] EXPR ew_u.parts.lsw [L158] (ly) = ew_u.parts.lsw [L160] iy = hy & 0x7fffffff VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L161-L162] COND TRUE ((ix | ((lx | -lx) >> 31)) > 0x7ff00000) || ((iy | ((ly | -ly) >> 31)) > 0x7ff00000) [L163] return x + y; VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L253] double res = __ieee754_atan2(y, x); [L255] COND TRUE res != pi VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] [L256] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-2:0}, atanlo_atan={-3:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_lo_atan2=3061616997868382943/25000000000000000000000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, tiny_atan2=1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. UNSAFE Result, 0.7s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 161 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=113occurred 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.2s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:51:32,409 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:51:32,411 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:51:32,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:51:32,429 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:51:32,433 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:51:32,435 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:51:32,436 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:51:32,440 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:51:32,441 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:51:32,445 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:51:32,446 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:51:32,450 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:51:32,451 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:51:32,454 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:51:32,455 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:51:32,456 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:51:32,458 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:51:32,460 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:51:32,462 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:51:32,463 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:51:32,464 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:51:32,472 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:51:32,473 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:51:32,473 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:51:32,474 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:51:32,475 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:51:32,476 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:51:32,476 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:51:32,477 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:51:32,477 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:51:32,478 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:51:32,478 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:51:32,478 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:51:32,479 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:51:32,480 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:51:32,480 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:51:32,510 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:51:32,513 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:51:32,514 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:51:32,514 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:51:32,518 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:51:32,519 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:51:32,519 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:51:32,519 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:51:32,519 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:51:32,519 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:51:32,519 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:51:32,521 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:51:32,521 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:51:32,521 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:51:32,521 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:51:32,522 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:51:32,522 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:51:32,522 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:51:32,522 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:51:32,522 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:51:32,525 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:51:32,525 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:51:32,525 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:51:32,526 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:51:32,526 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:51:32,526 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:51:32,526 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:51:32,526 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:51:32,526 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:51:32,527 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:51:32,527 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 -> 6672245f6516202a276f3cff39e39bf6cfceaf3d [2018-12-31 03:51:32,601 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:51:32,620 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:51:32,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:51:32,631 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:51:32,632 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:51:32,633 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0680b_true-unreach-call.c [2018-12-31 03:51:32,699 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44dc8451b/e18784892c9f49c6bba85798003ca062/FLAG605d9914d [2018-12-31 03:51:33,178 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:51:33,179 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0680b_true-unreach-call.c [2018-12-31 03:51:33,188 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44dc8451b/e18784892c9f49c6bba85798003ca062/FLAG605d9914d [2018-12-31 03:51:33,489 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44dc8451b/e18784892c9f49c6bba85798003ca062 [2018-12-31 03:51:33,492 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:51:33,494 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:51:33,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:51:33,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:51:33,499 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:51:33,500 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:51:33" (1/1) ... [2018-12-31 03:51:33,503 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f69343b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:33, skipping insertion in model container [2018-12-31 03:51:33,503 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:51:33" (1/1) ... [2018-12-31 03:51:33,511 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:51:33,560 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:51:33,904 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:51:33,920 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:51:34,014 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:51:34,137 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:51:34,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34 WrapperNode [2018-12-31 03:51:34,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:51:34,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:51:34,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:51:34,139 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:51:34,150 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34" (1/1) ... [2018-12-31 03:51:34,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34" (1/1) ... [2018-12-31 03:51:34,221 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:51:34,221 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:51:34,221 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:51:34,221 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:51:34,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34" (1/1) ... [2018-12-31 03:51:34,234 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34" (1/1) ... [2018-12-31 03:51:34,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34" (1/1) ... [2018-12-31 03:51:34,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34" (1/1) ... [2018-12-31 03:51:34,276 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34" (1/1) ... [2018-12-31 03:51:34,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34" (1/1) ... [2018-12-31 03:51:34,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34" (1/1) ... [2018-12-31 03:51:34,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:51:34,308 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:51:34,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:51:34,311 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:51:34,312 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:51:34,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2018-12-31 03:51:34,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:51:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:51:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2018-12-31 03:51:34,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:51:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:51:34,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:51:34,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-31 03:51:34,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:51:34,946 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:35,188 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:37,925 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:37,956 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:38,117 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:38,182 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:38,266 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:38,312 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:38,350 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:40,174 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:40,213 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:40,235 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:51:40,260 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:52:12,856 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:52:12,972 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:52:16,002 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:52:16,002 INFO L280 CfgBuilder]: Removed 44 assue(true) statements. [2018-12-31 03:52:16,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:52:16 BoogieIcfgContainer [2018-12-31 03:52:16,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:52:16,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:52:16,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:52:16,008 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:52:16,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:51:33" (1/3) ... [2018-12-31 03:52:16,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e49654e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:52:16, skipping insertion in model container [2018-12-31 03:52:16,009 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:51:34" (2/3) ... [2018-12-31 03:52:16,009 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e49654e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:52:16, skipping insertion in model container [2018-12-31 03:52:16,010 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:52:16" (3/3) ... [2018-12-31 03:52:16,012 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0680b_true-unreach-call.c [2018-12-31 03:52:16,023 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:52:16,032 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:52:16,050 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:52:16,082 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:52:16,083 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:52:16,084 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:52:16,084 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:52:16,084 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:52:16,084 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:52:16,085 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:52:16,085 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:52:16,085 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:52:16,103 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2018-12-31 03:52:16,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:52:16,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:16,111 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:52:16,114 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:16,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:16,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1264059097, now seen corresponding path program 1 times [2018-12-31 03:52:16,126 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:16,126 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2018-12-31 03:52:16,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:16,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:16,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:16,527 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:16,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:16,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:52:16,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:52:16,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:52:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:52:16,582 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 2 states. [2018-12-31 03:52:16,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:16,640 INFO L93 Difference]: Finished difference Result 224 states and 378 transitions. [2018-12-31 03:52:16,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:52:16,642 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 03:52:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:16,664 INFO L225 Difference]: With dead ends: 224 [2018-12-31 03:52:16,664 INFO L226 Difference]: Without dead ends: 110 [2018-12-31 03:52:16,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:52:16,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-12-31 03:52:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-12-31 03:52:16,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-12-31 03:52:16,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2018-12-31 03:52:16,722 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 10 [2018-12-31 03:52:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:16,722 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2018-12-31 03:52:16,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:52:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2018-12-31 03:52:16,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:52:16,723 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:16,723 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:52:16,724 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:16,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:16,724 INFO L82 PathProgramCache]: Analyzing trace with hash -925329470, now seen corresponding path program 1 times [2018-12-31 03:52:16,725 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:16,726 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2018-12-31 03:52:16,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:17,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:17,713 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:17,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:17,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:52:17,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:52:17,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:52:17,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:52:17,740 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand 7 states. [2018-12-31 03:52:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:20,988 INFO L93 Difference]: Finished difference Result 161 states and 226 transitions. [2018-12-31 03:52:20,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:52:20,990 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-12-31 03:52:20,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:20,992 INFO L225 Difference]: With dead ends: 161 [2018-12-31 03:52:20,992 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 03:52:20,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:52:20,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 03:52:21,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-31 03:52:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 03:52:21,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 93 transitions. [2018-12-31 03:52:21,017 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 93 transitions. Word has length 12 [2018-12-31 03:52:21,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:21,022 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 93 transitions. [2018-12-31 03:52:21,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:52:21,022 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 93 transitions. [2018-12-31 03:52:21,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:52:21,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:21,025 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:52:21,025 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:21,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:21,025 INFO L82 PathProgramCache]: Analyzing trace with hash 810615587, now seen corresponding path program 1 times [2018-12-31 03:52:21,028 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:21,028 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2018-12-31 03:52:21,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:21,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:21,519 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:21,520 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:21,522 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:21,522 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:21,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 76 [2018-12-31 03:52:21,567 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:21,570 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 71 [2018-12-31 03:52:21,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-31 03:52:21,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-12-31 03:52:21,783 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-31 03:52:21,883 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 29 treesize of output 23 [2018-12-31 03:52:21,919 INFO L683 Elim1Store]: detected equality via solver [2018-12-31 03:52:21,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2018-12-31 03:52:21,921 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-31 03:52:21,931 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:52:21,940 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-31 03:52:21,961 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-31 03:52:21,962 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:64, output treesize:28 [2018-12-31 03:52:22,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:22,129 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:22,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:22,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:52:22,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 03:52:22,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 03:52:22,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:52:22,146 INFO L87 Difference]: Start difference. First operand 71 states and 93 transitions. Second operand 5 states. [2018-12-31 03:52:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:24,868 INFO L93 Difference]: Finished difference Result 125 states and 164 transitions. [2018-12-31 03:52:25,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:52:25,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-31 03:52:25,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:25,253 INFO L225 Difference]: With dead ends: 125 [2018-12-31 03:52:25,253 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 03:52:25,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:52:25,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 03:52:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-31 03:52:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 03:52:25,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 92 transitions. [2018-12-31 03:52:25,274 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 92 transitions. Word has length 17 [2018-12-31 03:52:25,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:25,274 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 92 transitions. [2018-12-31 03:52:25,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 03:52:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2018-12-31 03:52:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:52:25,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:25,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:52:25,276 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1532035359, now seen corresponding path program 1 times [2018-12-31 03:52:25,277 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:25,277 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2018-12-31 03:52:25,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:25,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:26,001 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 26 [2018-12-31 03:52:26,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:26,030 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:26,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:26,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:52:26,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:52:26,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:52:26,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:52:26,050 INFO L87 Difference]: Start difference. First operand 71 states and 92 transitions. Second operand 7 states. [2018-12-31 03:52:29,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:29,103 INFO L93 Difference]: Finished difference Result 130 states and 171 transitions. [2018-12-31 03:52:29,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-31 03:52:29,105 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-31 03:52:29,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:29,107 INFO L225 Difference]: With dead ends: 130 [2018-12-31 03:52:29,107 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 03:52:29,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-31 03:52:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 03:52:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-31 03:52:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 03:52:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2018-12-31 03:52:29,132 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 17 [2018-12-31 03:52:29,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:29,133 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2018-12-31 03:52:29,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:52:29,133 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-12-31 03:52:29,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:52:29,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:29,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:52:29,135 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:29,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:29,136 INFO L82 PathProgramCache]: Analyzing trace with hash -255340040, now seen corresponding path program 1 times [2018-12-31 03:52:29,136 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:29,136 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2018-12-31 03:52:29,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:52:29,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:29,508 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:29,872 WARN L181 SmtUtils]: Spent 216.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 03:52:30,073 WARN L181 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-12-31 03:52:30,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:30,077 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:30,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:30,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:52:30,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 03:52:30,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 03:52:30,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:52:30,093 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 5 states. [2018-12-31 03:52:30,635 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-12-31 03:52:31,109 WARN L181 SmtUtils]: Spent 451.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-12-31 03:52:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:33,315 INFO L93 Difference]: Finished difference Result 75 states and 93 transitions. [2018-12-31 03:52:33,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:52:33,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-12-31 03:52:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:33,319 INFO L225 Difference]: With dead ends: 75 [2018-12-31 03:52:33,319 INFO L226 Difference]: Without dead ends: 71 [2018-12-31 03:52:33,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:52:33,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-12-31 03:52:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-12-31 03:52:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-31 03:52:33,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 89 transitions. [2018-12-31 03:52:33,346 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 89 transitions. Word has length 18 [2018-12-31 03:52:33,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:33,346 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 89 transitions. [2018-12-31 03:52:33,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 03:52:33,347 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 89 transitions. [2018-12-31 03:52:33,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-31 03:52:33,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:52:33,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:52:33,350 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:52:33,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:52:33,350 INFO L82 PathProgramCache]: Analyzing trace with hash 667658140, now seen corresponding path program 1 times [2018-12-31 03:52:33,352 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:52:33,352 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:52:33,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 03:52:33,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:52:33,683 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:52:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:52:33,916 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:52:33,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:52:33,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-31 03:52:33,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-31 03:52:33,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-31 03:52:33,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:52:33,933 INFO L87 Difference]: Start difference. First operand 71 states and 89 transitions. Second operand 7 states. [2018-12-31 03:52:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:52:34,504 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2018-12-31 03:52:34,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:52:34,504 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2018-12-31 03:52:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:52:34,505 INFO L225 Difference]: With dead ends: 71 [2018-12-31 03:52:34,505 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:52:34,506 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-31 03:52:34,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:52:34,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:52:34,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:52:34,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:52:34,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-12-31 03:52:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:52:34,508 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:52:34,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-31 03:52:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:52:34,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:52:34,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:52:34,798 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-12-31 03:52:34,957 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 40 [2018-12-31 03:52:36,319 WARN L181 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 97 DAG size of output: 87 [2018-12-31 03:52:36,322 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:36,322 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:36,322 INFO L444 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2018-12-31 03:52:36,323 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:36,323 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-12-31 03:52:36,323 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2018-12-31 03:52:36,323 INFO L448 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2018-12-31 03:52:36,323 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2018-12-31 03:52:36,323 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2018-12-31 03:52:36,323 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-12-31 03:52:36,323 INFO L448 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2018-12-31 03:52:36,323 INFO L448 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2018-12-31 03:52:36,324 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-12-31 03:52:36,324 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2018-12-31 03:52:36,324 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:36,324 INFO L448 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2018-12-31 03:52:36,324 INFO L448 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:36,324 INFO L448 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2018-12-31 03:52:36,324 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2018-12-31 03:52:36,324 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:36,324 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:36,325 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-31 03:52:36,327 INFO L444 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (exists ((v_prenex_61 (_ BitVec 64)) (|v_q#valueAsBitvector_18| (_ BitVec 64))) (let ((.cse0 ((_ extract 31 0) v_prenex_61))) (and (= .cse0 ((_ extract 31 0) |v_q#valueAsBitvector_18|)) (= ULTIMATE.start___ieee754_atan2_~hy~0 ((_ extract 63 32) |v_q#valueAsBitvector_18|)) (= ULTIMATE.start___ieee754_atan2_~ly~0 .cse0) (= (_ +zero 11 53) (fp ((_ extract 63 63) |v_q#valueAsBitvector_18|) ((_ extract 62 52) |v_q#valueAsBitvector_18|) ((_ extract 51 0) |v_q#valueAsBitvector_18|))) (= ((_ extract 63 32) v_prenex_61) .cse0)))) (exists ((|v_q#valueAsBitvector_17| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_17|)) ULTIMATE.start___ieee754_atan2_~iy~0) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_17|) ((_ extract 62 52) |v_q#valueAsBitvector_17|) ((_ extract 51 0) |v_q#valueAsBitvector_17|)) (_ +zero 11 53)))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (= (fp.add roundNearestTiesToEven ~pi~0 .cse1) |ULTIMATE.start___ieee754_atan2_#res|) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (exists ((ULTIMATE.start___ieee754_atan2_~hy~0 (_ BitVec 32)) (|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))) (= ULTIMATE.start___ieee754_atan2_~m~0 (bvor (bvand (_ bv1 32) (bvashr ULTIMATE.start___ieee754_atan2_~hy~0 (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) |v_q#valueAsBitvector_19|) (_ bv30 32))))))) (= ~tiny_atan2~0 .cse1) (exists ((|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_q#valueAsBitvector_19|)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_16|)) ULTIMATE.start___ieee754_atan2_~ix~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.neg (_ +zero 11 53))))))) [2018-12-31 03:52:36,327 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2018-12-31 03:52:36,327 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2018-12-31 03:52:36,327 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:36,327 INFO L448 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2018-12-31 03:52:36,328 INFO L444 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2018-12-31 03:52:36,328 INFO L448 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2018-12-31 03:52:36,328 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-12-31 03:52:36,328 INFO L448 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2018-12-31 03:52:36,328 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2018-12-31 03:52:36,328 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2018-12-31 03:52:36,328 INFO L444 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (and (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2018-12-31 03:52:36,328 INFO L448 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2018-12-31 03:52:36,328 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-12-31 03:52:36,329 INFO L448 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2018-12-31 03:52:36,329 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2018-12-31 03:52:36,329 INFO L448 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2018-12-31 03:52:36,329 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2018-12-31 03:52:36,329 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2018-12-31 03:52:36,329 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2018-12-31 03:52:36,329 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2018-12-31 03:52:36,329 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2018-12-31 03:52:36,329 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:52:36,329 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2018-12-31 03:52:36,330 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:52:36,330 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2018-12-31 03:52:36,330 INFO L448 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2018-12-31 03:52:36,330 INFO L444 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2018-12-31 03:52:36,330 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:52:36,330 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2018-12-31 03:52:36,330 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2018-12-31 03:52:36,330 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-12-31 03:52:36,330 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-12-31 03:52:36,331 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2018-12-31 03:52:36,335 INFO L444 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (and (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= (_ +zero 11 53) ULTIMATE.start___ieee754_atan2_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start___ieee754_atan2_~x) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (exists ((|v_q#valueAsBitvector_19| (_ BitVec 64))) (and (= ULTIMATE.start___ieee754_atan2_~hx~1 ((_ extract 63 32) |v_q#valueAsBitvector_19|)) (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_19|) ((_ extract 62 52) |v_q#valueAsBitvector_19|) ((_ extract 51 0) |v_q#valueAsBitvector_19|))))) (exists ((|v_q#valueAsBitvector_16| (_ BitVec 64))) (and (= (bvand (_ bv2147483647 32) ((_ extract 63 32) |v_q#valueAsBitvector_16|)) ULTIMATE.start___ieee754_atan2_~ix~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_16|) ((_ extract 62 52) |v_q#valueAsBitvector_16|) ((_ extract 51 0) |v_q#valueAsBitvector_16|)) (fp.neg (_ +zero 11 53)))))) [2018-12-31 03:52:36,335 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:36,335 INFO L448 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2018-12-31 03:52:36,335 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2018-12-31 03:52:36,335 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2018-12-31 03:52:36,336 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:36,336 INFO L448 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:36,336 INFO L448 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:36,336 INFO L448 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2018-12-31 03:52:36,336 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 256) no Hoare annotation was computed. [2018-12-31 03:52:36,336 INFO L448 ceAbstractionStarter]: For program point L255(lines 255 258) no Hoare annotation was computed. [2018-12-31 03:52:36,336 INFO L448 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2018-12-31 03:52:36,336 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2018-12-31 03:52:36,336 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2018-12-31 03:52:36,336 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:36,337 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:52:36,337 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:36,337 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:36,337 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:52:36,337 INFO L448 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:36,337 INFO L448 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:36,337 INFO L448 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2018-12-31 03:52:36,337 INFO L448 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2018-12-31 03:52:36,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:52:36,338 INFO L448 ceAbstractionStarter]: For program point L256(line 256) no Hoare annotation was computed. [2018-12-31 03:52:36,338 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-31 03:52:36,338 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2018-12-31 03:52:36,338 INFO L444 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2018-12-31 03:52:36,338 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-12-31 03:52:36,338 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2018-12-31 03:52:36,338 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2018-12-31 03:52:36,338 INFO L451 ceAbstractionStarter]: At program point L259(lines 244 260) the Hoare annotation is: true [2018-12-31 03:52:36,338 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:52:36,339 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2018-12-31 03:52:36,343 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2018-12-31 03:52:36,343 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2018-12-31 03:52:36,343 INFO L444 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2018-12-31 03:52:36,343 INFO L444 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2018-12-31 03:52:36,343 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2018-12-31 03:52:36,343 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2018-12-31 03:52:36,343 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2018-12-31 03:52:36,344 INFO L448 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2018-12-31 03:52:36,344 INFO L448 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2018-12-31 03:52:36,344 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-12-31 03:52:36,344 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2018-12-31 03:52:36,344 INFO L448 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2018-12-31 03:52:36,344 INFO L444 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2018-12-31 03:52:36,344 INFO L448 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2018-12-31 03:52:36,344 INFO L448 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2018-12-31 03:52:36,344 INFO L448 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2018-12-31 03:52:36,348 INFO L444 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2018-12-31 03:52:36,348 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2018-12-31 03:52:36,348 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2018-12-31 03:52:36,348 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:52:36,348 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-31 03:52:36,348 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2018-12-31 03:52:36,348 INFO L444 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2018-12-31 03:52:36,358 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,359 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,363 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,363 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,365 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,366 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,367 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,369 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,369 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,373 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,374 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,376 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,376 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,376 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2018-12-31 03:52:36,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,377 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,383 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,384 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,384 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,385 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2018-12-31 03:52:36,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,386 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:52:36 BoogieIcfgContainer [2018-12-31 03:52:36,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:52:36,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:52:36,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:52:36,393 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:52:36,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:52:16" (3/4) ... [2018-12-31 03:52:36,397 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:52:36,435 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-12-31 03:52:36,436 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-31 03:52:36,477 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) [2018-12-31 03:52:36,478 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_prenex_61 : bv64, v_q#valueAsBitvector_18 : bv64 :: (((v_prenex_61[31:0] == v_q#valueAsBitvector_18[31:0] && hy == v_q#valueAsBitvector_18[63:32]) && ly == v_prenex_61[31:0]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0])) && v_prenex_61[63:32] == v_prenex_61[31:0]) && (\exists v_q#valueAsBitvector_17 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == iy && ~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]) == ~Pluszero~LONGDOUBLE())) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~Pluszero~LONGDOUBLE() == y) && ~fp.add~DOUBLE(~roundNearestTiesToEven, pi, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists ULTIMATE.start___ieee754_atan2_~hy~0 : bv32, v_q#valueAsBitvector_19 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_q#valueAsBitvector_19[63:32], 30bv32))))) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) [2018-12-31 03:52:36,588 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:52:36,588 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:52:36,589 INFO L168 Benchmark]: Toolchain (without parser) took 63096.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 199.2 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 28.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:36,589 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:52:36,590 INFO L168 Benchmark]: CACSL2BoogieTranslator took 643.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:36,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.57 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:36,591 INFO L168 Benchmark]: Boogie Preprocessor took 86.50 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:36,592 INFO L168 Benchmark]: RCFGBuilder took 41694.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:36,592 INFO L168 Benchmark]: TraceAbstraction took 20388.00 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -88.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:52:36,592 INFO L168 Benchmark]: Witness Printer took 195.59 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: 7.4 MB). Peak memory consumption was 7.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:52:36,595 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 643.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -170.4 MB). Peak memory consumption was 36.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.57 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.50 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 41694.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 66.5 MB). Peak memory consumption was 66.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20388.00 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 68.7 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -88.0 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 195.59 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: 7.4 MB). Peak memory consumption was 7.4 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,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_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 256]: 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: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 147]: Loop Invariant [2018-12-31 03:52:36,602 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,602 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,603 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,603 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 17]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 224]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2018-12-31 03:52:36,604 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,604 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,612 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,613 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,613 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,613 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,614 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] Derived loop invariant: ((((pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000) && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 244]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 142]: Loop Invariant [2018-12-31 03:52:36,620 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,623 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,625 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2018-12-31 03:52:36,626 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,626 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,627 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,630 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_18,QUANTIFIED] [2018-12-31 03:52:36,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_61,QUANTIFIED] [2018-12-31 03:52:36,633 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_17,QUANTIFIED] [2018-12-31 03:52:36,635 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,635 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,635 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,635 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___ieee754_atan2_~hy~0,QUANTIFIED] [2018-12-31 03:52:36,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,636 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2018-12-31 03:52:36,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,636 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_19,QUANTIFIED] [2018-12-31 03:52:36,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] [2018-12-31 03:52:36,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_16,QUANTIFIED] Derived loop invariant: (((((((((\exists v_prenex_61 : bv64, v_q#valueAsBitvector_18 : bv64 :: (((v_prenex_61[31:0] == v_q#valueAsBitvector_18[31:0] && hy == v_q#valueAsBitvector_18[63:32]) && ly == v_prenex_61[31:0]) && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_q#valueAsBitvector_18[63:63], v_q#valueAsBitvector_18[62:52], v_q#valueAsBitvector_18[51:0])) && v_prenex_61[63:32] == v_prenex_61[31:0]) && (\exists v_q#valueAsBitvector_17 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_17[63:32]) == iy && ~fp~LONGDOUBLE(v_q#valueAsBitvector_17[63:63], v_q#valueAsBitvector_17[62:52], v_q#valueAsBitvector_17[51:0]) == ~Pluszero~LONGDOUBLE())) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~Pluszero~LONGDOUBLE() == y) && ~fp.add~DOUBLE(~roundNearestTiesToEven, pi, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) == \result) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists ULTIMATE.start___ieee754_atan2_~hy~0 : bv32, v_q#valueAsBitvector_19 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(ULTIMATE.start___ieee754_atan2_~hy~0, 31bv32)), ~bvand32(2bv32, ~bvashr32(v_q#valueAsBitvector_19[63:32], 30bv32))))) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_q#valueAsBitvector_19 : bv64 :: hx == v_q#valueAsBitvector_19[63:32] && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_19[63:63], v_q#valueAsBitvector_19[62:52], v_q#valueAsBitvector_19[51:0]))) && (\exists v_q#valueAsBitvector_16 : bv64 :: ~bvand32(2147483647bv32, v_q#valueAsBitvector_16[63:32]) == ix && ~fp~LONGDOUBLE(v_q#valueAsBitvector_16[63:63], v_q#valueAsBitvector_16[62:52], v_q#valueAsBitvector_16[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 113 locations, 1 error locations. SAFE Result, 20.2s OverallTime, 6 OverallIterations, 1 TraceHistogramMax, 13.3s AutomataDifference, 0.0s DeadEndRemovalTime, 1.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 487 SDtfs, 1042 SDslu, 270 SDs, 0 SdLazy, 122 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 17 LocationsWithAnnotation, 17 PreInvPairs, 21 NumberOfFragments, 216 HoareAnnotationTreeSize, 17 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 17 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 93 NumberOfCodeBlocks, 93 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 87 ConstructedInterpolants, 32 QuantifiedInterpolants, 17394 SizeOfPredicates, 37 NumberOfNonLiveVariables, 785 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...