./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_0682a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/float-newlib/double_req_bl_0682a_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 fcf534df2acf49cd98974d7f01989073db823dea ................................................................................................................................................................................................................................................................................................................................................................................. 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_0682a_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 fcf534df2acf49cd98974d7f01989073db823dea ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:02:25,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:02:25,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:02:25,562 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:02:25,564 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:02:25,565 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:02:25,567 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:02:25,570 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:02:25,572 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:02:25,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:02:25,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:02:25,574 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:02:25,575 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:02:25,576 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:02:25,578 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:02:25,579 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:02:25,580 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:02:25,582 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:02:25,584 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:02:25,586 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:02:25,587 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:02:25,589 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:02:25,591 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:02:25,592 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:02:25,592 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:02:25,594 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:02:25,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:02:25,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:02:25,597 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:02:25,598 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:02:25,598 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:02:25,599 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:02:25,600 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:02:25,600 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:02:25,601 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:02:25,602 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:02:25,602 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 09:02:25,621 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:02:25,621 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:02:25,622 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:02:25,623 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:02:25,623 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:02:25,623 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:02:25,624 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:02:25,624 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 09:02:25,624 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:02:25,624 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:02:25,624 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:02:25,625 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:02:25,627 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:02:25,627 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:02:25,627 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:02:25,628 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:02:25,628 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:02:25,628 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:02:25,628 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:02:25,628 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:02:25,629 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:02:25,629 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:02:25,629 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:02:25,629 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:02:25,629 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:02:25,629 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 09:02:25,633 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:02:25,633 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 09:02:25,633 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 -> fcf534df2acf49cd98974d7f01989073db823dea [2019-01-12 09:02:25,701 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:02:25,720 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:02:25,725 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:02:25,730 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:02:25,730 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:02:25,731 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0682a_true-unreach-call.c [2019-01-12 09:02:25,807 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fcdf8ca9/2941a9b828b541a48d2acee52a9ec882/FLAGdf9000c2f [2019-01-12 09:02:26,348 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:02:26,348 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0682a_true-unreach-call.c [2019-01-12 09:02:26,358 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fcdf8ca9/2941a9b828b541a48d2acee52a9ec882/FLAGdf9000c2f [2019-01-12 09:02:26,664 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fcdf8ca9/2941a9b828b541a48d2acee52a9ec882 [2019-01-12 09:02:26,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:02:26,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:02:26,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:02:26,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:02:26,678 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:02:26,679 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:02:26" (1/1) ... [2019-01-12 09:02:26,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a0c3a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:26, skipping insertion in model container [2019-01-12 09:02:26,683 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:02:26" (1/1) ... [2019-01-12 09:02:26,693 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:02:26,744 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:02:27,129 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:02:27,146 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:02:27,237 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:02:27,350 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:02:27,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:27 WrapperNode [2019-01-12 09:02:27,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:02:27,353 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:02:27,353 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:02:27,353 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:02:27,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:27" (1/1) ... [2019-01-12 09:02:27,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:27" (1/1) ... [2019-01-12 09:02:27,435 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:02:27,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:02:27,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:02:27,438 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:02:27,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:27" (1/1) ... [2019-01-12 09:02:27,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:27" (1/1) ... [2019-01-12 09:02:27,457 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:27" (1/1) ... [2019-01-12 09:02:27,457 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:27" (1/1) ... [2019-01-12 09:02:27,486 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:27" (1/1) ... [2019-01-12 09:02:27,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:27" (1/1) ... [2019-01-12 09:02:27,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:27" (1/1) ... [2019-01-12 09:02:27,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:02:27,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:02:27,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:02:27,510 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:02:27,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02: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 [2019-01-12 09:02:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:02:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-01-12 09:02:27,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-12 09:02:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-01-12 09:02:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:02:27,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:02:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-12 09:02:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-01-12 09:02:27,592 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:02:29,156 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:02:29,156 INFO L286 CfgBuilder]: Removed 52 assue(true) statements. [2019-01-12 09:02:29,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:02:29 BoogieIcfgContainer [2019-01-12 09:02:29,158 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:02:29,159 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:02:29,159 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:02:29,163 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:02:29,163 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:02:26" (1/3) ... [2019-01-12 09:02:29,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b65e807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:02:29, skipping insertion in model container [2019-01-12 09:02:29,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:27" (2/3) ... [2019-01-12 09:02:29,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b65e807 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:02:29, skipping insertion in model container [2019-01-12 09:02:29,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:02:29" (3/3) ... [2019-01-12 09:02:29,166 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682a_true-unreach-call.c [2019-01-12 09:02:29,177 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:02:29,186 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:02:29,204 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:02:29,239 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:02:29,240 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:02:29,240 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:02:29,240 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:02:29,240 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:02:29,241 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:02:29,241 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:02:29,241 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:02:29,241 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:02:29,263 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-01-12 09:02:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:02:29,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:29,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:29,274 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:29,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:29,282 INFO L82 PathProgramCache]: Analyzing trace with hash -617567418, now seen corresponding path program 1 times [2019-01-12 09:02:29,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:02:29,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:02:29,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:02:29,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:29,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:02:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:29,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:02:29,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:29,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:02:29,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:02:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:02:29,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:02:29,487 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-01-12 09:02:29,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:29,520 INFO L93 Difference]: Finished difference Result 246 states and 412 transitions. [2019-01-12 09:02:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:02:29,522 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-01-12 09:02:29,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:29,536 INFO L225 Difference]: With dead ends: 246 [2019-01-12 09:02:29,536 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 09:02:29,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:02:29,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 09:02:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-01-12 09:02:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 09:02:29,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2019-01-12 09:02:29,588 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 15 [2019-01-12 09:02:29,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:29,589 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2019-01-12 09:02:29,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:02:29,589 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2019-01-12 09:02:29,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:02:29,590 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:29,591 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:29,591 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:29,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:29,591 INFO L82 PathProgramCache]: Analyzing trace with hash -397782484, now seen corresponding path program 1 times [2019-01-12 09:02:29,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:02:29,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:02:29,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:02:29,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:29,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:02:29,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:02:29,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:02:29,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:02:29,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:02:29,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:02:29,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:02:29,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:02:29,734 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand 3 states. [2019-01-12 09:02:29,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:02:29,793 INFO L93 Difference]: Finished difference Result 229 states and 326 transitions. [2019-01-12 09:02:29,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:02:29,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-12 09:02:29,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:02:29,797 INFO L225 Difference]: With dead ends: 229 [2019-01-12 09:02:29,797 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 09:02:29,799 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:02:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 09:02:29,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-01-12 09:02:29,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 09:02:29,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2019-01-12 09:02:29,811 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 18 [2019-01-12 09:02:29,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:02:29,812 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2019-01-12 09:02:29,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:02:29,812 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2019-01-12 09:02:29,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:02:29,813 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:02:29,813 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:02:29,813 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:02:29,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:02:29,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1006577033, now seen corresponding path program 1 times [2019-01-12 09:02:29,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 09:02:29,814 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 09:02:29,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:02:29,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:02:29,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 09:02:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:02:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-12 09:02:30,516 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-12 09:02:30,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:02:30 BoogieIcfgContainer [2019-01-12 09:02:30,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:02:30,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:02:30,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:02:30,608 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:02:30,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:02:29" (3/4) ... [2019-01-12 09:02:30,616 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-12 09:02:30,616 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:02:30,617 INFO L168 Benchmark]: Toolchain (without parser) took 3947.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.0 MB). Peak memory consumption was 138.2 MB. Max. memory is 11.5 GB. [2019-01-12 09:02:30,620 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:02:30,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:02:30,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:02:30,624 INFO L168 Benchmark]: Boogie Preprocessor took 72.74 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. [2019-01-12 09:02:30,625 INFO L168 Benchmark]: RCFGBuilder took 1648.24 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: 58.5 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:02:30,627 INFO L168 Benchmark]: TraceAbstraction took 1448.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 929.9 MB in the end (delta: 114.8 MB). Peak memory consumption was 114.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:02:30,628 INFO L168 Benchmark]: Witness Printer took 8.07 ms. Allocated memory is still 1.2 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:02:30,636 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 680.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.45 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 72.74 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 1648.24 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: 58.5 MB). Peak memory consumption was 58.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1448.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 929.9 MB in the end (delta: 114.8 MB). Peak memory consumption was 114.8 MB. Max. memory is 11.5 GB. * Witness Printer took 8.07 ms. Allocated memory is still 1.2 GB. Free memory is still 929.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 285]: 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 52, overapproximation of someBinaryArithmeticDOUBLEoperation at line 163, overapproximation of bitwiseAnd at line 160, overapproximation of someBinaryDOUBLEComparisonOperation at line 284. 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={-1: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] [L276] double x = -1.0 / 0.0; [L277] double y = __VERIFIER_nondet_double(); [L246] __int32_t hx, lx; VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L248] ieee_double_shape_type ew_u; [L249] ew_u.value = (x) [L250] EXPR ew_u.parts.msw [L250] (hx) = ew_u.parts.msw [L251] EXPR ew_u.parts.lsw [L251] (lx) = ew_u.parts.lsw [L253] hx &= 0x7fffffff [L254] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L255] hx = 0x7ff00000 - hx [L256] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L279] EXPR isinf_double(x) && isfinite_double(y) [L260] __int32_t hx; VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L262] ieee_double_shape_type gh_u; [L263] gh_u.value = (x) [L264] EXPR gh_u.parts.msw [L264] (hx) = gh_u.parts.msw [L266] return (int)((__uint32_t)((hx & 0x7fffffff) - 0x7ff00000) >> 31); VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L279] EXPR isinf_double(x) && isfinite_double(y) VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L279] COND TRUE isinf_double(x) && isfinite_double(y) && 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={-1: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={-1: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={-1: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={-1: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] [L281] double res = __ieee754_atan2(y, x); [L284] COND TRUE res != -pi VAL [aT_atan={1:0}, atanhi_atan={-1: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] [L285] __VERIFIER_error() VAL [aT_atan={1:0}, atanhi_atan={-1: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, 124 locations, 1 error locations. UNSAFE Result, 1.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 343 SDtfs, 0 SDslu, 163 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-0ed9222-m [2019-01-12 09:02:33,009 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 09:02:33,010 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 09:02:33,029 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 09:02:33,030 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 09:02:33,032 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 09:02:33,034 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 09:02:33,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 09:02:33,041 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 09:02:33,043 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 09:02:33,046 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 09:02:33,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 09:02:33,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 09:02:33,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 09:02:33,052 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 09:02:33,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 09:02:33,054 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 09:02:33,058 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 09:02:33,061 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 09:02:33,068 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 09:02:33,069 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 09:02:33,071 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 09:02:33,076 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 09:02:33,076 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 09:02:33,076 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 09:02:33,077 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 09:02:33,078 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 09:02:33,082 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 09:02:33,083 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 09:02:33,085 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 09:02:33,087 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 09:02:33,089 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 09:02:33,090 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 09:02:33,090 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 09:02:33,091 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 09:02:33,093 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 09:02:33,095 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-01-12 09:02:33,110 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 09:02:33,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 09:02:33,112 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 09:02:33,112 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 09:02:33,112 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 09:02:33,113 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 09:02:33,113 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 09:02:33,113 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 09:02:33,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 09:02:33,113 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 09:02:33,113 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 09:02:33,114 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 09:02:33,114 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2019-01-12 09:02:33,114 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-01-12 09:02:33,114 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 09:02:33,114 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 09:02:33,114 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 09:02:33,115 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 09:02:33,116 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 09:02:33,117 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 09:02:33,117 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 09:02:33,117 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 09:02:33,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 09:02:33,117 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 09:02:33,117 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 09:02:33,118 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 09:02:33,119 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2019-01-12 09:02:33,119 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 09:02:33,119 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-01-12 09:02:33,119 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2019-01-12 09:02:33,119 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 -> fcf534df2acf49cd98974d7f01989073db823dea [2019-01-12 09:02:33,157 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 09:02:33,170 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 09:02:33,174 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 09:02:33,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 09:02:33,176 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 09:02:33,177 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_0682a_true-unreach-call.c [2019-01-12 09:02:33,241 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f15da115/49fcf7ef54a549c5b9079f054f9e38b9/FLAG28cfa8264 [2019-01-12 09:02:33,759 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 09:02:33,762 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_0682a_true-unreach-call.c [2019-01-12 09:02:33,775 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f15da115/49fcf7ef54a549c5b9079f054f9e38b9/FLAG28cfa8264 [2019-01-12 09:02:34,053 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f15da115/49fcf7ef54a549c5b9079f054f9e38b9 [2019-01-12 09:02:34,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 09:02:34,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 09:02:34,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 09:02:34,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 09:02:34,064 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 09:02:34,065 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:02:34" (1/1) ... [2019-01-12 09:02:34,068 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af5ab78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34, skipping insertion in model container [2019-01-12 09:02:34,069 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 09:02:34" (1/1) ... [2019-01-12 09:02:34,077 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 09:02:34,112 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 09:02:34,374 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:02:34,387 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 09:02:34,463 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 09:02:34,590 INFO L195 MainTranslator]: Completed translation [2019-01-12 09:02:34,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34 WrapperNode [2019-01-12 09:02:34,591 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 09:02:34,592 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 09:02:34,592 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 09:02:34,592 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 09:02:34,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34" (1/1) ... [2019-01-12 09:02:34,621 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34" (1/1) ... [2019-01-12 09:02:34,676 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 09:02:34,677 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 09:02:34,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 09:02:34,677 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 09:02:34,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34" (1/1) ... [2019-01-12 09:02:34,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34" (1/1) ... [2019-01-12 09:02:34,698 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34" (1/1) ... [2019-01-12 09:02:34,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34" (1/1) ... [2019-01-12 09:02:34,730 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34" (1/1) ... [2019-01-12 09:02:34,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34" (1/1) ... [2019-01-12 09:02:34,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34" (1/1) ... [2019-01-12 09:02:34,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 09:02:34,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 09:02:34,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 09:02:34,757 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 09:02:34,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02: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 [2019-01-12 09:02:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-01-12 09:02:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-01-12 09:02:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 09:02:34,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-01-12 09:02:34,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-01-12 09:02:34,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 09:02:34,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 09:02:34,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-01-12 09:02:34,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-12 09:02:35,366 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:35,494 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:35,572 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:35,710 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:35,780 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:35,927 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:35,990 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:36,624 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:36,664 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:56,498 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:56,565 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:56,603 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:56,676 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:57,450 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:02:57,515 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:13,763 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:13,808 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-01-12 09:03:14,652 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 09:03:14,653 INFO L286 CfgBuilder]: Removed 52 assue(true) statements. [2019-01-12 09:03:14,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:03:14 BoogieIcfgContainer [2019-01-12 09:03:14,654 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 09:03:14,655 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 09:03:14,655 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 09:03:14,658 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 09:03:14,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 09:02:34" (1/3) ... [2019-01-12 09:03:14,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1849b24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:03:14, skipping insertion in model container [2019-01-12 09:03:14,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 09:02:34" (2/3) ... [2019-01-12 09:03:14,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1849b24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 09:03:14, skipping insertion in model container [2019-01-12 09:03:14,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:03:14" (3/3) ... [2019-01-12 09:03:14,661 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_0682a_true-unreach-call.c [2019-01-12 09:03:14,671 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 09:03:14,680 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 09:03:14,698 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 09:03:14,730 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 09:03:14,730 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 09:03:14,730 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 09:03:14,731 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 09:03:14,731 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 09:03:14,731 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 09:03:14,731 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 09:03:14,731 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 09:03:14,732 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 09:03:14,749 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-01-12 09:03:14,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-12 09:03:14,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:14,757 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:14,759 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:14,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:14,765 INFO L82 PathProgramCache]: Analyzing trace with hash -617567418, now seen corresponding path program 1 times [2019-01-12 09:03:14,769 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:03:14,770 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-01-12 09:03:14,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:03:15,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:15,102 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:03:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:03:15,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:03:15,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:03:15,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 09:03:15,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 09:03:15,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 09:03:15,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:03:15,155 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 2 states. [2019-01-12 09:03:15,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:03:15,191 INFO L93 Difference]: Finished difference Result 246 states and 412 transitions. [2019-01-12 09:03:15,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 09:03:15,193 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-01-12 09:03:15,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:03:15,208 INFO L225 Difference]: With dead ends: 246 [2019-01-12 09:03:15,209 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 09:03:15,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 09:03:15,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 09:03:15,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-01-12 09:03:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 09:03:15,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 169 transitions. [2019-01-12 09:03:15,267 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 169 transitions. Word has length 15 [2019-01-12 09:03:15,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:03:15,267 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 169 transitions. [2019-01-12 09:03:15,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 09:03:15,268 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 169 transitions. [2019-01-12 09:03:15,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-12 09:03:15,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:15,269 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:15,269 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:15,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:15,270 INFO L82 PathProgramCache]: Analyzing trace with hash -397782484, now seen corresponding path program 1 times [2019-01-12 09:03:15,272 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:03:15,272 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) [2019-01-12 09:03:15,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-01-12 09:03:15,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:15,609 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:03:15,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:03:15,633 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:03:15,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:03:15,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 09:03:15,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 09:03:15,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 09:03:15,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:03:15,653 INFO L87 Difference]: Start difference. First operand 120 states and 169 transitions. Second operand 3 states. [2019-01-12 09:03:15,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:03:15,835 INFO L93 Difference]: Finished difference Result 229 states and 326 transitions. [2019-01-12 09:03:15,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 09:03:15,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-01-12 09:03:15,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:03:15,838 INFO L225 Difference]: With dead ends: 229 [2019-01-12 09:03:15,838 INFO L226 Difference]: Without dead ends: 120 [2019-01-12 09:03:15,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 09:03:15,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-12 09:03:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-01-12 09:03:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-12 09:03:15,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 168 transitions. [2019-01-12 09:03:15,857 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 168 transitions. Word has length 18 [2019-01-12 09:03:15,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:03:15,857 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 168 transitions. [2019-01-12 09:03:15,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 09:03:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 168 transitions. [2019-01-12 09:03:15,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-01-12 09:03:15,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:15,859 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:15,859 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:15,860 INFO L82 PathProgramCache]: Analyzing trace with hash -1006577033, now seen corresponding path program 1 times [2019-01-12 09:03:15,861 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:03:15,861 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-01-12 09:03:15,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:03:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:16,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:03:17,114 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-01-12 09:03:17,299 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:03:17,300 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:03:17,301 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:03:17,303 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:03:17,310 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 58 treesize of output 85 [2019-01-12 09:03:17,472 WARN L181 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 28 [2019-01-12 09:03:17,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:03:17,487 INFO L683 Elim1Store]: detected equality via solver [2019-01-12 09:03:17,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 3 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 69 [2019-01-12 09:03:17,516 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:03:17,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2019-01-12 09:03:17,530 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-12 09:03:17,594 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:03:17,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2019-01-12 09:03:17,696 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 5 [2019-01-12 09:03:17,696 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-12 09:03:17,732 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:03:17,824 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-12 09:03:17,832 INFO L701 Elim1Store]: detected not equals via solver [2019-01-12 09:03:17,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-12 09:03:17,834 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-12 09:03:17,865 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:03:17,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-12 09:03:18,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-12 09:03:18,168 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 5 variables, input treesize:100, output treesize:52 [2019-01-12 09:03:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:03:18,750 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:03:18,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:03:18,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-12 09:03:18,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-12 09:03:18,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-12 09:03:18,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-12 09:03:18,777 INFO L87 Difference]: Start difference. First operand 120 states and 168 transitions. Second operand 12 states. [2019-01-12 09:03:22,123 WARN L181 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-01-12 09:03:22,396 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-01-12 09:03:22,969 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-01-12 09:03:23,557 WARN L181 SmtUtils]: Spent 231.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-01-12 09:03:27,017 WARN L181 SmtUtils]: Spent 2.28 s on a formula simplification that was a NOOP. DAG size: 86 [2019-01-12 09:03:27,571 WARN L181 SmtUtils]: Spent 412.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-01-12 09:03:29,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:03:29,971 INFO L93 Difference]: Finished difference Result 170 states and 235 transitions. [2019-01-12 09:03:30,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-12 09:03:30,352 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-01-12 09:03:30,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:03:30,354 INFO L225 Difference]: With dead ends: 170 [2019-01-12 09:03:30,355 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 09:03:30,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-01-12 09:03:30,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 09:03:30,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-12 09:03:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 09:03:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 110 transitions. [2019-01-12 09:03:30,386 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 110 transitions. Word has length 22 [2019-01-12 09:03:30,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:03:30,387 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 110 transitions. [2019-01-12 09:03:30,388 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-12 09:03:30,388 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 110 transitions. [2019-01-12 09:03:30,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-12 09:03:30,389 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:30,389 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:30,390 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:30,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:30,391 INFO L82 PathProgramCache]: Analyzing trace with hash 906713717, now seen corresponding path program 1 times [2019-01-12 09:03:30,392 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:03:30,392 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-01-12 09:03:30,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:03:30,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:30,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:03:31,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:03:31,213 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:03:31,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:03:31,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:03:31,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:03:31,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:03:31,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:03:31,228 INFO L87 Difference]: Start difference. First operand 85 states and 110 transitions. Second operand 7 states. [2019-01-12 09:03:35,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:03:35,570 INFO L93 Difference]: Finished difference Result 163 states and 214 transitions. [2019-01-12 09:03:35,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:03:35,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2019-01-12 09:03:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:03:35,573 INFO L225 Difference]: With dead ends: 163 [2019-01-12 09:03:35,573 INFO L226 Difference]: Without dead ends: 100 [2019-01-12 09:03:35,574 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:03:35,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-12 09:03:35,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2019-01-12 09:03:35,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 09:03:35,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 108 transitions. [2019-01-12 09:03:35,601 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 108 transitions. Word has length 27 [2019-01-12 09:03:35,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:03:35,602 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 108 transitions. [2019-01-12 09:03:35,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:03:35,602 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 108 transitions. [2019-01-12 09:03:35,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 09:03:35,604 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:35,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:35,604 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:35,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:35,605 INFO L82 PathProgramCache]: Analyzing trace with hash -188522611, now seen corresponding path program 1 times [2019-01-12 09:03:35,606 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:03:35,606 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) [2019-01-12 09:03:35,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-01-12 09:03:35,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:35,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:03:39,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:03:39,889 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:03:39,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:03:39,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:03:39,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:03:39,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:03:39,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2019-01-12 09:03:39,906 INFO L87 Difference]: Start difference. First operand 85 states and 108 transitions. Second operand 10 states. [2019-01-12 09:03:44,550 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-12 09:03:44,845 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-01-12 09:03:47,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:03:47,998 INFO L93 Difference]: Finished difference Result 89 states and 111 transitions. [2019-01-12 09:03:48,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:03:48,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-01-12 09:03:48,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:03:48,003 INFO L225 Difference]: With dead ends: 89 [2019-01-12 09:03:48,003 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 09:03:48,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=74, Invalid=165, Unknown=1, NotChecked=0, Total=240 [2019-01-12 09:03:48,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 09:03:48,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-12 09:03:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 09:03:48,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 107 transitions. [2019-01-12 09:03:48,041 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 107 transitions. Word has length 28 [2019-01-12 09:03:48,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:03:48,042 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 107 transitions. [2019-01-12 09:03:48,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:03:48,042 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 107 transitions. [2019-01-12 09:03:48,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-01-12 09:03:48,044 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:48,045 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:48,045 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:48,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:48,045 INFO L82 PathProgramCache]: Analyzing trace with hash -953381006, now seen corresponding path program 1 times [2019-01-12 09:03:48,047 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:03:48,047 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-01-12 09:03:48,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:03:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:48,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:03:48,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:03:48,641 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:03:48,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:03:48,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 09:03:48,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 09:03:48,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 09:03:48,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:03:48,663 INFO L87 Difference]: Start difference. First operand 85 states and 107 transitions. Second operand 7 states. [2019-01-12 09:03:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:03:51,809 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2019-01-12 09:03:51,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 09:03:51,812 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-01-12 09:03:51,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:03:51,814 INFO L225 Difference]: With dead ends: 89 [2019-01-12 09:03:51,815 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 09:03:51,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-01-12 09:03:51,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 09:03:51,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-12 09:03:51,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 09:03:51,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2019-01-12 09:03:51,882 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 28 [2019-01-12 09:03:51,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:03:51,882 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2019-01-12 09:03:51,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 09:03:51,883 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2019-01-12 09:03:51,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-01-12 09:03:51,883 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:51,883 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:51,886 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:51,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:51,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1555968818, now seen corresponding path program 1 times [2019-01-12 09:03:51,887 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:03:51,887 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2019-01-12 09:03:51,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-01-12 09:03:52,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:52,236 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:03:52,651 WARN L181 SmtUtils]: Spent 372.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:03:53,091 WARN L181 SmtUtils]: Spent 287.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 09:03:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:03:53,095 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:03:53,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:03:53,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 09:03:53,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 09:03:53,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 09:03:53,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 09:03:53,110 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand 5 states. [2019-01-12 09:03:53,520 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 09:03:54,120 WARN L181 SmtUtils]: Spent 469.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 09:03:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:03:56,454 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2019-01-12 09:03:56,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 09:03:56,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-01-12 09:03:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:03:56,457 INFO L225 Difference]: With dead ends: 89 [2019-01-12 09:03:56,457 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 09:03:56,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-12 09:03:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 09:03:56,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-12 09:03:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 09:03:56,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2019-01-12 09:03:56,499 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 29 [2019-01-12 09:03:56,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:03:56,500 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2019-01-12 09:03:56,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 09:03:56,500 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2019-01-12 09:03:56,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-12 09:03:56,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:03:56,501 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:03:56,502 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:03:56,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:03:56,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1532150515, now seen corresponding path program 1 times [2019-01-12 09:03:56,503 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:03:56,503 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-01-12 09:03:56,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:03:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:03:56,934 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:04:01,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:04:01,320 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:04:01,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:04:01,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 09:04:01,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 09:04:01,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 09:04:01,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2019-01-12 09:04:01,336 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand 10 states. [2019-01-12 09:04:04,646 WARN L181 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-01-12 09:04:07,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:04:07,083 INFO L93 Difference]: Finished difference Result 89 states and 106 transitions. [2019-01-12 09:04:07,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 09:04:07,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-01-12 09:04:07,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:04:07,086 INFO L225 Difference]: With dead ends: 89 [2019-01-12 09:04:07,086 INFO L226 Difference]: Without dead ends: 85 [2019-01-12 09:04:07,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=74, Invalid=165, Unknown=1, NotChecked=0, Total=240 [2019-01-12 09:04:07,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-01-12 09:04:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-01-12 09:04:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-01-12 09:04:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 102 transitions. [2019-01-12 09:04:07,131 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 102 transitions. Word has length 30 [2019-01-12 09:04:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:04:07,133 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 102 transitions. [2019-01-12 09:04:07,133 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 09:04:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 102 transitions. [2019-01-12 09:04:07,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 09:04:07,136 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 09:04:07,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 09:04:07,136 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 09:04:07,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 09:04:07,138 INFO L82 PathProgramCache]: Analyzing trace with hash -851569117, now seen corresponding path program 1 times [2019-01-12 09:04:07,139 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2019-01-12 09:04:07,139 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-01-12 09:04:07,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 09:04:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 09:04:07,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 09:04:07,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 09:04:07,828 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2019-01-12 09:04:07,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 09:04:07,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 09:04:07,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 09:04:07,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 09:04:07,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-01-12 09:04:07,857 INFO L87 Difference]: Start difference. First operand 85 states and 102 transitions. Second operand 8 states. [2019-01-12 09:04:08,397 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-01-12 09:04:08,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 09:04:08,399 INFO L93 Difference]: Finished difference Result 85 states and 102 transitions. [2019-01-12 09:04:08,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 09:04:08,399 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-01-12 09:04:08,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 09:04:08,399 INFO L225 Difference]: With dead ends: 85 [2019-01-12 09:04:08,399 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 09:04:08,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-01-12 09:04:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 09:04:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 09:04:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 09:04:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 09:04:08,403 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-01-12 09:04:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 09:04:08,403 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 09:04:08,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 09:04:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 09:04:08,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 09:04:08,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 09:04:08,910 WARN L181 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-01-12 09:04:09,047 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-01-12 09:04:09,747 WARN L181 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 82 [2019-01-12 09:04:11,548 WARN L181 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 157 DAG size of output: 129 [2019-01-12 09:04:11,551 INFO L448 ceAbstractionStarter]: For program point L68-3(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:04:11,551 INFO L448 ceAbstractionStarter]: For program point L68-5(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:04:11,552 INFO L444 ceAbstractionStarter]: At program point L68-6(lines 68 72) the Hoare annotation is: false [2019-01-12 09:04:11,552 INFO L448 ceAbstractionStarter]: For program point L68-7(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:04:11,552 INFO L448 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-01-12 09:04:11,552 INFO L448 ceAbstractionStarter]: For program point L168(lines 168 178) no Hoare annotation was computed. [2019-01-12 09:04:11,552 INFO L448 ceAbstractionStarter]: For program point L168-2(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:04:11,552 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 177) no Hoare annotation was computed. [2019-01-12 09:04:11,552 INFO L448 ceAbstractionStarter]: For program point L203(line 203) no Hoare annotation was computed. [2019-01-12 09:04:11,552 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2019-01-12 09:04:11,553 INFO L448 ceAbstractionStarter]: For program point L170-2(line 170) no Hoare annotation was computed. [2019-01-12 09:04:11,553 INFO L448 ceAbstractionStarter]: For program point L237(line 237) no Hoare annotation was computed. [2019-01-12 09:04:11,553 INFO L448 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-01-12 09:04:11,553 INFO L448 ceAbstractionStarter]: For program point L105(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:04:11,553 INFO L448 ceAbstractionStarter]: For program point L105-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:04:11,553 INFO L448 ceAbstractionStarter]: For program point L105-3(lines 105 111) no Hoare annotation was computed. [2019-01-12 09:04:11,553 INFO L448 ceAbstractionStarter]: For program point L105-5(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:04:11,553 INFO L448 ceAbstractionStarter]: For program point L239(line 239) no Hoare annotation was computed. [2019-01-12 09:04:11,553 INFO L448 ceAbstractionStarter]: For program point L173(line 173) no Hoare annotation was computed. [2019-01-12 09:04:11,553 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:04:11,554 INFO L448 ceAbstractionStarter]: For program point L74-1(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:04:11,556 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 09:04:11,556 INFO L444 ceAbstractionStarter]: At program point L142(lines 142 242) the Hoare annotation is: (let ((.cse3 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) (and (exists ((v_prenex_69 (_ BitVec 64)) (v_prenex_68 (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_prenex_68))) (and (= ((_ extract 31 0) v_prenex_68) ULTIMATE.start___ieee754_atan2_~lx~0) (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) .cse0)) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_68) ((_ extract 62 52) v_prenex_68) ((_ extract 51 0) v_prenex_68))) (= .cse0 ((_ extract 63 32) v_prenex_69))))) (exists ((v_prenex_74 (_ BitVec 64)) (v_prenex_73 (_ BitVec 64))) (let ((.cse1 ((_ extract 63 32) v_prenex_74))) (and (fp.lt (fp ((_ extract 63 63) v_prenex_74) ((_ extract 62 52) v_prenex_74) ((_ extract 51 0) v_prenex_74)) (_ +zero 11 53)) (= (bvand (_ bv2147483647 32) .cse1) ULTIMATE.start___ieee754_atan2_~iy~0) (= ULTIMATE.start___ieee754_atan2_~m~0 (bvor (bvand (_ bv1 32) (bvashr .cse1 (_ bv31 32))) (bvand (_ bv2 32) (bvashr ((_ extract 63 32) v_prenex_73) (_ bv30 32))))) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_73) ((_ extract 62 52) v_prenex_73) ((_ extract 51 0) v_prenex_73)))))) (exists ((v_prenex_71 (_ BitVec 64))) (and (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_71)) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32))) (= (fp ((_ extract 63 63) v_prenex_71) ((_ extract 62 52) v_prenex_71) ((_ extract 51 0) v_prenex_71)) ULTIMATE.start___ieee754_atan2_~y))) (= |ULTIMATE.start___ieee754_atan2_#res| (fp.sub roundNearestTiesToEven (fp.neg ~pi~0) .cse2)) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)) (= .cse3 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~y~0) (exists ((v_prenex_67 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0) (= ((_ extract 63 32) v_prenex_67) ULTIMATE.start_isfinite_double_~hx~3))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (exists ((v_prenex_70 (_ BitVec 64)) (v_prenex_71 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_70) ((_ extract 62 52) v_prenex_70) ((_ extract 51 0) v_prenex_70)))) (and (= (fp ((_ extract 63 63) v_prenex_71) ((_ extract 62 52) v_prenex_71) ((_ extract 51 0) v_prenex_71)) .cse4) (= ((_ extract 63 32) v_prenex_70) ULTIMATE.start___ieee754_atan2_~hy~0) (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_71)) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32))) (fp.lt .cse4 (_ +zero 11 53))))) (exists ((v_prenex_67 (_ BitVec 64))) (and (= |ULTIMATE.start_isfinite_double_#res| (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_67)) (_ bv2148532224 32)) (_ bv31 32))) (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0))) (= (bvand (_ bv2147483647 32) ULTIMATE.start___ieee754_atan2_~hy~0) ULTIMATE.start___ieee754_atan2_~iy~0) (= .cse3 ULTIMATE.start___ieee754_atan2_~x) (exists ((v_prenex_69 (_ BitVec 64)) (v_prenex_68 (_ BitVec 64))) (let ((.cse5 ((_ extract 63 32) v_prenex_68))) (and (= ((_ extract 31 0) v_prenex_68) ULTIMATE.start___ieee754_atan2_~lx~0) (= .cse5 ULTIMATE.start___ieee754_atan2_~hx~1) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_68) ((_ extract 62 52) v_prenex_68) ((_ extract 51 0) v_prenex_68))) (= .cse5 ((_ extract 63 32) v_prenex_69))))) (= ~tiny_atan2~0 .cse2))) [2019-01-12 09:04:11,557 INFO L448 ceAbstractionStarter]: For program point L76-1(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:04:11,557 INFO L444 ceAbstractionStarter]: At program point L76-2(lines 76 80) the Hoare annotation is: false [2019-01-12 09:04:11,557 INFO L448 ceAbstractionStarter]: For program point L76-3(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:04:11,557 INFO L448 ceAbstractionStarter]: For program point L76-5(lines 76 80) no Hoare annotation was computed. [2019-01-12 09:04:11,557 INFO L444 ceAbstractionStarter]: At program point L76-6(lines 76 80) the Hoare annotation is: false [2019-01-12 09:04:11,557 INFO L448 ceAbstractionStarter]: For program point L76-7(lines 74 87) no Hoare annotation was computed. [2019-01-12 09:04:11,557 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2019-01-12 09:04:11,557 INFO L448 ceAbstractionStarter]: For program point L210-2(line 210) no Hoare annotation was computed. [2019-01-12 09:04:11,557 INFO L448 ceAbstractionStarter]: For program point L279(line 279) no Hoare annotation was computed. [2019-01-12 09:04:11,558 INFO L448 ceAbstractionStarter]: For program point L279-2(lines 279 288) no Hoare annotation was computed. [2019-01-12 09:04:11,558 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:04:11,558 INFO L448 ceAbstractionStarter]: For program point L279-4(lines 279 288) no Hoare annotation was computed. [2019-01-12 09:04:11,558 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:04:11,558 INFO L444 ceAbstractionStarter]: At program point L147-2(lines 147 152) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (and (= .cse0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~y~0) (exists ((v_prenex_67 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0) (= ((_ extract 63 32) v_prenex_67) ULTIMATE.start_isfinite_double_~hx~3))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= .cse0 ULTIMATE.start___ieee754_atan2_~x) (exists ((v_prenex_67 (_ BitVec 64))) (and (= |ULTIMATE.start_isfinite_double_#res| (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_67)) (_ bv2148532224 32)) (_ bv31 32))) (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0))) (exists ((v_prenex_71 (_ BitVec 64))) (and (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_71)) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32))) (= (fp ((_ extract 63 63) v_prenex_71) ((_ extract 62 52) v_prenex_71) ((_ extract 51 0) v_prenex_71)) ULTIMATE.start___ieee754_atan2_~y))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)))) [2019-01-12 09:04:11,558 INFO L448 ceAbstractionStarter]: For program point L147-3(lines 147 152) no Hoare annotation was computed. [2019-01-12 09:04:11,558 INFO L448 ceAbstractionStarter]: For program point L247-1(lines 247 252) no Hoare annotation was computed. [2019-01-12 09:04:11,558 INFO L444 ceAbstractionStarter]: At program point L247-2(lines 247 252) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~x~0) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L247-3(lines 247 252) no Hoare annotation was computed. [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L181-2(line 181) no Hoare annotation was computed. [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 218) no Hoare annotation was computed. [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L215-2(lines 213 218) no Hoare annotation was computed. [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L83-1(lines 83 86) no Hoare annotation was computed. [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L183(lines 183 207) no Hoare annotation was computed. [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 142 242) no Hoare annotation was computed. [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L184(lines 184 206) no Hoare annotation was computed. [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L19-1(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:04:11,559 INFO L444 ceAbstractionStarter]: At program point L19-2(lines 19 23) the Hoare annotation is: false [2019-01-12 09:04:11,559 INFO L448 ceAbstractionStarter]: For program point L19-5(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:04:11,560 INFO L444 ceAbstractionStarter]: At program point L19-6(lines 19 23) the Hoare annotation is: false [2019-01-12 09:04:11,560 INFO L448 ceAbstractionStarter]: For program point L19-9(lines 19 23) no Hoare annotation was computed. [2019-01-12 09:04:11,560 INFO L444 ceAbstractionStarter]: At program point L19-10(lines 19 23) the Hoare annotation is: false [2019-01-12 09:04:11,560 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 09:04:11,560 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 287) no Hoare annotation was computed. [2019-01-12 09:04:11,560 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 194) no Hoare annotation was computed. [2019-01-12 09:04:11,560 INFO L448 ceAbstractionStarter]: For program point L285(line 285) no Hoare annotation was computed. [2019-01-12 09:04:11,560 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 241) no Hoare annotation was computed. [2019-01-12 09:04:11,560 INFO L448 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-01-12 09:04:11,560 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2019-01-12 09:04:11,560 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:04:11,561 INFO L444 ceAbstractionStarter]: At program point L154-2(lines 154 159) the Hoare annotation is: (let ((.cse1 (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)))) (and (exists ((v_prenex_69 (_ BitVec 64)) (v_prenex_68 (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_prenex_68))) (and (= ((_ extract 31 0) v_prenex_68) ULTIMATE.start___ieee754_atan2_~lx~0) (= ULTIMATE.start___ieee754_atan2_~ix~1 (bvand (_ bv2147483647 32) .cse0)) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_68) ((_ extract 62 52) v_prenex_68) ((_ extract 51 0) v_prenex_68))) (= .cse0 ((_ extract 63 32) v_prenex_69))))) (= .cse1 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~y~0) (exists ((v_prenex_67 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0) (= ((_ extract 63 32) v_prenex_67) ULTIMATE.start_isfinite_double_~hx~3))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= .cse1 ULTIMATE.start___ieee754_atan2_~x) (exists ((v_prenex_67 (_ BitVec 64))) (and (= |ULTIMATE.start_isfinite_double_#res| (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_67)) (_ bv2148532224 32)) (_ bv31 32))) (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0))) (exists ((v_prenex_71 (_ BitVec 64))) (and (not (= (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_71)) (_ bv2148532224 32)) (_ bv31 32)) (_ bv0 32))) (= (fp ((_ extract 63 63) v_prenex_71) ((_ extract 62 52) v_prenex_71) ((_ extract 51 0) v_prenex_71)) ULTIMATE.start___ieee754_atan2_~y))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0))) (exists ((v_prenex_69 (_ BitVec 64)) (v_prenex_68 (_ BitVec 64))) (let ((.cse2 ((_ extract 63 32) v_prenex_68))) (and (= ((_ extract 31 0) v_prenex_68) ULTIMATE.start___ieee754_atan2_~lx~0) (= .cse2 ULTIMATE.start___ieee754_atan2_~hx~1) (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) (fp ((_ extract 63 63) v_prenex_68) ((_ extract 62 52) v_prenex_68) ((_ extract 51 0) v_prenex_68))) (= .cse2 ((_ extract 63 32) v_prenex_69))))) (fp.lt ULTIMATE.start___ieee754_atan2_~y (_ +zero 11 53)))) [2019-01-12 09:04:11,561 INFO L448 ceAbstractionStarter]: For program point L88(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:04:11,561 INFO L448 ceAbstractionStarter]: For program point L154-3(lines 154 159) no Hoare annotation was computed. [2019-01-12 09:04:11,561 INFO L448 ceAbstractionStarter]: For program point L88-2(lines 88 113) no Hoare annotation was computed. [2019-01-12 09:04:11,561 INFO L448 ceAbstractionStarter]: For program point L188(line 188) no Hoare annotation was computed. [2019-01-12 09:04:11,561 INFO L448 ceAbstractionStarter]: For program point L89(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:04:11,561 INFO L448 ceAbstractionStarter]: For program point L89-2(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:04:11,561 INFO L448 ceAbstractionStarter]: For program point L89-3(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:04:11,562 INFO L448 ceAbstractionStarter]: For program point L89-5(lines 89 92) no Hoare annotation was computed. [2019-01-12 09:04:11,562 INFO L448 ceAbstractionStarter]: For program point L222(line 222) no Hoare annotation was computed. [2019-01-12 09:04:11,562 INFO L448 ceAbstractionStarter]: For program point L90(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:04:11,562 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 90 91) no Hoare annotation was computed. [2019-01-12 09:04:11,562 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:11,562 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:04:11,562 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:11,562 INFO L448 ceAbstractionStarter]: For program point L24-3(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:11,562 INFO L448 ceAbstractionStarter]: For program point L24-4(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:04:11,562 INFO L448 ceAbstractionStarter]: For program point L24-5(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:11,563 INFO L448 ceAbstractionStarter]: For program point L24-6(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:11,563 INFO L448 ceAbstractionStarter]: For program point L24-7(lines 17 31) no Hoare annotation was computed. [2019-01-12 09:04:11,563 INFO L448 ceAbstractionStarter]: For program point L24-8(lines 24 29) no Hoare annotation was computed. [2019-01-12 09:04:11,563 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 09:04:11,563 INFO L444 ceAbstractionStarter]: At program point L256(lines 245 257) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~x~0) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2019-01-12 09:04:11,563 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 09:04:11,563 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 285) no Hoare annotation was computed. [2019-01-12 09:04:11,563 INFO L451 ceAbstractionStarter]: At program point L290(lines 269 291) the Hoare annotation is: true [2019-01-12 09:04:11,563 INFO L448 ceAbstractionStarter]: For program point L224-1(lines 224 228) no Hoare annotation was computed. [2019-01-12 09:04:11,563 INFO L444 ceAbstractionStarter]: At program point L224-2(lines 224 228) the Hoare annotation is: false [2019-01-12 09:04:11,564 INFO L448 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-01-12 09:04:11,564 INFO L448 ceAbstractionStarter]: For program point L126(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:04:11,567 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 126 131) no Hoare annotation was computed. [2019-01-12 09:04:11,567 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 09:04:11,567 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 163) no Hoare annotation was computed. [2019-01-12 09:04:11,568 INFO L448 ceAbstractionStarter]: For program point L261-1(lines 261 265) no Hoare annotation was computed. [2019-01-12 09:04:11,568 INFO L444 ceAbstractionStarter]: At program point L261-2(lines 261 265) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~y~0) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2019-01-12 09:04:11,568 INFO L448 ceAbstractionStarter]: For program point L261-3(lines 261 265) no Hoare annotation was computed. [2019-01-12 09:04:11,568 INFO L448 ceAbstractionStarter]: For program point L96(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:04:11,568 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 96 112) no Hoare annotation was computed. [2019-01-12 09:04:11,568 INFO L444 ceAbstractionStarter]: At program point L30(lines 17 31) the Hoare annotation is: false [2019-01-12 09:04:11,568 INFO L444 ceAbstractionStarter]: At program point L30-1(lines 17 31) the Hoare annotation is: false [2019-01-12 09:04:11,568 INFO L444 ceAbstractionStarter]: At program point L30-2(lines 17 31) the Hoare annotation is: false [2019-01-12 09:04:11,569 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:04:11,569 INFO L448 ceAbstractionStarter]: For program point L196(lines 196 205) no Hoare annotation was computed. [2019-01-12 09:04:11,569 INFO L448 ceAbstractionStarter]: For program point L229-1(lines 222 235) no Hoare annotation was computed. [2019-01-12 09:04:11,569 INFO L448 ceAbstractionStarter]: For program point L229-2(lines 229 234) no Hoare annotation was computed. [2019-01-12 09:04:11,569 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 09:04:11,569 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:04:11,569 INFO L448 ceAbstractionStarter]: For program point L130-2(line 130) no Hoare annotation was computed. [2019-01-12 09:04:11,569 INFO L444 ceAbstractionStarter]: At program point L130-3(lines 64 132) the Hoare annotation is: false [2019-01-12 09:04:11,569 INFO L448 ceAbstractionStarter]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2019-01-12 09:04:11,569 INFO L448 ceAbstractionStarter]: For program point L130-4(line 130) no Hoare annotation was computed. [2019-01-12 09:04:11,569 INFO L448 ceAbstractionStarter]: For program point L130-6(line 130) no Hoare annotation was computed. [2019-01-12 09:04:11,569 INFO L444 ceAbstractionStarter]: At program point L130-7(lines 64 132) the Hoare annotation is: false [2019-01-12 09:04:11,570 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2019-01-12 09:04:11,570 INFO L448 ceAbstractionStarter]: For program point L164(lines 164 165) no Hoare annotation was computed. [2019-01-12 09:04:11,570 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 09:04:11,570 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 09:04:11,570 INFO L444 ceAbstractionStarter]: At program point L266(lines 259 267) the Hoare annotation is: (and (= (fp.div roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (_ +zero 11 53)) ULTIMATE.start_main_~x~0) (= ULTIMATE.start_isfinite_double_~x ULTIMATE.start_main_~y~0) (exists ((v_prenex_67 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0) (= ((_ extract 63 32) v_prenex_67) ULTIMATE.start_isfinite_double_~hx~3))) (= ~pi~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 250000000000000000.0))) (exists ((v_prenex_67 (_ BitVec 64))) (and (= |ULTIMATE.start_isfinite_double_#res| (bvlshr (bvadd (bvand (_ bv2147483647 32) ((_ extract 63 32) v_prenex_67)) (_ bv2148532224 32)) (_ bv31 32))) (= (fp ((_ extract 63 63) v_prenex_67) ((_ extract 62 52) v_prenex_67) ((_ extract 51 0) v_prenex_67)) ULTIMATE.start_main_~y~0))) (= ~tiny_atan2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000.0)))) [2019-01-12 09:04:11,570 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 68 72) no Hoare annotation was computed. [2019-01-12 09:04:11,570 INFO L444 ceAbstractionStarter]: At program point L68-2(lines 68 72) the Hoare annotation is: false [2019-01-12 09:04:11,597 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,598 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,598 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,599 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,600 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,600 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,600 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,602 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,602 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,602 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,603 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,603 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,604 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,605 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,609 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,609 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,609 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,610 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,610 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,610 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,611 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,611 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,615 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,616 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,616 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,620 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,621 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,622 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,623 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,625 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,630 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,631 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,631 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,632 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,632 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,632 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,633 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,634 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,635 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,635 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,636 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,636 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,636 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,637 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,639 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,640 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,640 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,640 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,640 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,640 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,641 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,641 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,646 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,647 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,651 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,651 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:11,651 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,652 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,652 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,652 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,652 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,652 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,653 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,656 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,656 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,657 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,657 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,657 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,657 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,657 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,658 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,659 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,659 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,659 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,659 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,659 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,660 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,663 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:11,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,668 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,669 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,669 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:11,670 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,670 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,670 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,671 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,671 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,671 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,672 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,674 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,675 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,676 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,676 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,676 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,676 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,678 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,679 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:11,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,680 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,681 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,681 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,681 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,682 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,683 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,684 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,685 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,688 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,688 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,688 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,689 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:11,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:11,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:11,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:11,690 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:11,691 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:11,691 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:11,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,691 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:11,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:11,692 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:11,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,693 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,694 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,695 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,695 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,695 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,695 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,696 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,696 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,697 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,698 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,699 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,700 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,700 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,700 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,700 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,701 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,701 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,702 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:11,702 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,703 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,704 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,705 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,706 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,706 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:11,707 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:11,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:11,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:11,708 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:11,709 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:11,709 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:11,710 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,710 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,710 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:11,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:11,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:11,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,711 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,712 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,713 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,713 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,713 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,714 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,714 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,714 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,715 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,715 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,716 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,717 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:11,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,718 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,719 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,719 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,719 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,720 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,720 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,720 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,721 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:11,721 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 09:04:11 BoogieIcfgContainer [2019-01-12 09:04:11,725 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 09:04:11,725 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 09:04:11,725 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 09:04:11,725 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 09:04:11,726 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 09:03:14" (3/4) ... [2019-01-12 09:04:11,731 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 09:04:11,765 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2019-01-12 09:04:11,766 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2019-01-12 09:04:11,767 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-12 09:04:11,808 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) [2019-01-12 09:04:11,808 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && (\exists v_prenex_71 : bv64 :: !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32) && ~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == y)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE()) [2019-01-12 09:04:11,809 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\exists v_prenex_69 : bv64, v_prenex_68 : bv64 :: ((v_prenex_68[31:0] == lx && ix == ~bvand32(2147483647bv32, v_prenex_68[63:32])) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_68[63:63], v_prenex_68[62:52], v_prenex_68[51:0])) && v_prenex_68[63:32] == v_prenex_69[63:32]) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && (\exists v_prenex_71 : bv64 :: !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32) && ~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == y)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_prenex_69 : bv64, v_prenex_68 : bv64 :: ((v_prenex_68[31:0] == lx && v_prenex_68[63:32] == hx) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_68[63:63], v_prenex_68[62:52], v_prenex_68[51:0])) && v_prenex_68[63:32] == v_prenex_69[63:32])) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE()) [2019-01-12 09:04:11,809 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((\exists v_prenex_69 : bv64, v_prenex_68 : bv64 :: ((v_prenex_68[31:0] == lx && ix == ~bvand32(2147483647bv32, v_prenex_68[63:32])) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_68[63:63], v_prenex_68[62:52], v_prenex_68[51:0])) && v_prenex_68[63:32] == v_prenex_69[63:32]) && (\exists v_prenex_74 : bv64, v_prenex_73 : bv64 :: ((~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_prenex_74[63:63], v_prenex_74[62:52], v_prenex_74[51:0]), ~Pluszero~LONGDOUBLE()) && ~bvand32(2147483647bv32, v_prenex_74[63:32]) == iy) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(v_prenex_74[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(v_prenex_73[63:32], 30bv32)))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_73[63:63], v_prenex_73[62:52], v_prenex_73[51:0]))) && (\exists v_prenex_71 : bv64 :: !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32) && ~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == y)) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && (\exists v_prenex_70 : bv64, v_prenex_71 : bv64 :: ((~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == ~fp~LONGDOUBLE(v_prenex_70[63:63], v_prenex_70[62:52], v_prenex_70[51:0]) && v_prenex_70[63:32] == hy) && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32)) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_prenex_70[63:63], v_prenex_70[62:52], v_prenex_70[51:0]), ~Pluszero~LONGDOUBLE()))) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && ~bvand32(2147483647bv32, hy) == iy) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_prenex_69 : bv64, v_prenex_68 : bv64 :: ((v_prenex_68[31:0] == lx && v_prenex_68[63:32] == hx) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_68[63:63], v_prenex_68[62:52], v_prenex_68[51:0])) && v_prenex_68[63:32] == v_prenex_69[63:32])) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) [2019-01-12 09:04:11,918 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 09:04:11,918 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 09:04:11,922 INFO L168 Benchmark]: Toolchain (without parser) took 97864.74 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 283.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -195.0 MB). Peak memory consumption was 88.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:11,923 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 09:04:11,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 531.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:11,925 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.55 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:11,925 INFO L168 Benchmark]: Boogie Preprocessor took 80.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:11,927 INFO L168 Benchmark]: RCFGBuilder took 39897.22 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: 73.1 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:11,927 INFO L168 Benchmark]: TraceAbstraction took 57069.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -119.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:11,928 INFO L168 Benchmark]: Witness Printer took 193.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2019-01-12 09:04:11,933 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 531.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -179.3 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.55 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: 8.5 MB). Peak memory consumption was 8.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 39897.22 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: 73.1 MB). Peak memory consumption was 73.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57069.52 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 145.2 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -119.5 MB). Peak memory consumption was 25.7 MB. Max. memory is 11.5 GB. * Witness Printer took 193.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,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_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,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_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,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_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,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_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,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_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,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_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,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_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 285]: 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 [2019-01-12 09:04:11,952 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,952 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,957 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,958 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,958 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,958 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,963 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,964 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,964 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,965 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,965 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,965 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,965 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,969 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,970 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:11,970 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && (\exists v_prenex_71 : bv64 :: !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32) && ~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == y)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE()) - 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: 259]: Loop Invariant [2019-01-12 09:04:11,975 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,975 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,975 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,976 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,979 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,980 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,981 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,981 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 247]: Loop Invariant [2019-01-12 09:04:11,982 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,984 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 245]: Loop Invariant [2019-01-12 09:04:11,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,985 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,986 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,989 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,989 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,990 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,990 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,990 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 269]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 68]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 154]: Loop Invariant [2019-01-12 09:04:11,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,991 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,991 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,992 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:11,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:11,995 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,995 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,996 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,996 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,996 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:11,996 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,996 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:11,997 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,002 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,002 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,002 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,002 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,002 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,002 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:12,006 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,009 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,009 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:12,010 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,011 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,011 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,011 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,012 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,015 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,016 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,029 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,029 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,029 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,030 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] Derived loop invariant: ((((((((((\exists v_prenex_69 : bv64, v_prenex_68 : bv64 :: ((v_prenex_68[31:0] == lx && ix == ~bvand32(2147483647bv32, v_prenex_68[63:32])) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_68[63:63], v_prenex_68[62:52], v_prenex_68[51:0])) && v_prenex_68[63:32] == v_prenex_69[63:32]) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && (\exists v_prenex_71 : bv64 :: !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32) && ~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == y)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000)) && (\exists v_prenex_69 : bv64, v_prenex_68 : bv64 :: ((v_prenex_68[31:0] == lx && v_prenex_68[63:32] == hx) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_68[63:63], v_prenex_68[62:52], v_prenex_68[51:0])) && v_prenex_68[63:32] == v_prenex_69[63:32])) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 261]: Loop Invariant [2019-01-12 09:04:12,031 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,031 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,031 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,047 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,047 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,048 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,048 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,048 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x && x == y) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - InvariantResult [Line: 142]: Loop Invariant [2019-01-12 09:04:12,048 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,049 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,049 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,049 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:12,050 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:12,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:12,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:12,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:12,051 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:12,052 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:12,071 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,071 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:12,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:12,072 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:12,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,073 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,074 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,074 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,074 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,074 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,074 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,075 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,076 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,076 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,077 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,099 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,100 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,100 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,101 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,101 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,101 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,101 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,102 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:12,102 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,104 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,104 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,104 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,126 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,126 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:12,127 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:12,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:12,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:12,128 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:12,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_74,QUANTIFIED] [2019-01-12 09:04:12,129 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:12,129 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,130 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,130 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:12,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:12,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_73,QUANTIFIED] [2019-01-12 09:04:12,131 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,132 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,132 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,132 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,133 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,154 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,154 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,155 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,155 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,156 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_71,QUANTIFIED] [2019-01-12 09:04:12,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_70,QUANTIFIED] [2019-01-12 09:04:12,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,157 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_67,QUANTIFIED] [2019-01-12 09:04:12,158 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,158 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,158 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,178 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,178 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-01-12 09:04:12,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,178 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_68,QUANTIFIED] [2019-01-12 09:04:12,179 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_69,QUANTIFIED] [2019-01-12 09:04:12,179 WARN L416 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((((((((((\exists v_prenex_69 : bv64, v_prenex_68 : bv64 :: ((v_prenex_68[31:0] == lx && ix == ~bvand32(2147483647bv32, v_prenex_68[63:32])) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_68[63:63], v_prenex_68[62:52], v_prenex_68[51:0])) && v_prenex_68[63:32] == v_prenex_69[63:32]) && (\exists v_prenex_74 : bv64, v_prenex_73 : bv64 :: ((~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_prenex_74[63:63], v_prenex_74[62:52], v_prenex_74[51:0]), ~Pluszero~LONGDOUBLE()) && ~bvand32(2147483647bv32, v_prenex_74[63:32]) == iy) && m == ~bvor32(~bvand32(1bv32, ~bvashr32(v_prenex_74[63:32], 31bv32)), ~bvand32(2bv32, ~bvashr32(v_prenex_73[63:32], 30bv32)))) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_73[63:63], v_prenex_73[62:52], v_prenex_73[51:0]))) && (\exists v_prenex_71 : bv64 :: !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32) && ~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == y)) && \result == ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(pi), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000))) && ~fp.lt~DOUBLE(y, ~Pluszero~LONGDOUBLE())) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && x == y) && (\exists v_prenex_67 : bv64 :: ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y && v_prenex_67[63:32] == hx)) && pi == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/250000000000000000)) && (\exists v_prenex_70 : bv64, v_prenex_71 : bv64 :: ((~fp~LONGDOUBLE(v_prenex_71[63:63], v_prenex_71[62:52], v_prenex_71[51:0]) == ~fp~LONGDOUBLE(v_prenex_70[63:63], v_prenex_70[62:52], v_prenex_70[51:0]) && v_prenex_70[63:32] == hy) && !(~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_71[63:32]), 2148532224bv32), 31bv32) == 0bv32)) && ~fp.lt~DOUBLE(~fp~LONGDOUBLE(v_prenex_70[63:63], v_prenex_70[62:52], v_prenex_70[51:0]), ~Pluszero~LONGDOUBLE()))) && (\exists v_prenex_67 : bv64 :: \result == ~bvlshr32(~bvadd64(~bvand32(2147483647bv32, v_prenex_67[63:32]), 2148532224bv32), 31bv32) && ~fp~LONGDOUBLE(v_prenex_67[63:63], v_prenex_67[62:52], v_prenex_67[51:0]) == y)) && ~bvand32(2147483647bv32, hy) == iy) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_prenex_69 : bv64, v_prenex_68 : bv64 :: ((v_prenex_68[31:0] == lx && v_prenex_68[63:32] == hx) && ~fp.div~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_prenex_68[63:63], v_prenex_68[62:52], v_prenex_68[51:0])) && v_prenex_68[63:32] == v_prenex_69[63:32])) && tiny_atan2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 124 locations, 1 error locations. SAFE Result, 56.8s OverallTime, 9 OverallIterations, 1 TraceHistogramMax, 37.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 896 SDtfs, 2403 SDslu, 1403 SDs, 0 SdLazy, 344 SolverSat, 78 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 21.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 259 GetRequests, 174 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 23.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 21 PreInvPairs, 29 NumberOfFragments, 641 HoareAnnotationTreeSize, 21 FomulaSimplifications, 303 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 21 FomulaSimplificationsInter, 236 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 224 ConstructedInterpolants, 68 QuantifiedInterpolants, 91200 SizeOfPredicates, 61 NumberOfNonLiveVariables, 1565 ConjunctsInSsa, 104 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...